Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_k4_B.smt2

Publications: Tomas Kolarik, Stefan Ratschan and Pavel Surynek: "Multi-Agent Path-Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic" in ICAART, SCITEPRESS, 2024.
The benchmarks mimic MAPF problems with continuous time where the objective time must be sub-optimal, bounded by a user-specified coefficient. In the original solver, a simulator checks whether there are collisions between particular agents, according to the current model. This check is missing in the case of the final 'check-sat'. The benchmarks also lack commands for preferring certain variables during the search which is of huge importance when searching for short paths in a graph. However, the final plan must still avoid all collisions encountered by the original solver and the objective time must obey the sub-optimal coefficient. Producing models is crucial for the application since the intended solver communicates values of particular variables with the simulator. This communication is ommited though for simplicity. The final 'get-value' allows to compare with the original solver that the objective time indeed obeys the coefficient. Filenames without the extensions correspond to filenames of resulting plans of the original solver.

Benchmark
Size	100649
Compressed Size	8479
License	Creative Commons Attribution 4.0 International (CC-BY-4.0)
Category	industrial
First Occurrence	—
Generated By	Tomas Kolarik
Generated On	2024-04-14 00:00:00
Generator	gitlab.com/Tomaqa/mapf_r
Dolmen OK	1
strict Dolmen OK	1
check-sat calls	5

Query 1

Status	sat
Inferred Status	None
Size	92201
Compressed Size	7875
Max. Term Depth	7
Asserts	928
Declared Functions	0
Declared Constants	248
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	821	or	1087	and	659	=	2334
+	92	-	72	*	72	<=	48

Query 2

Status	sat
Inferred Status	None
Size	94554
Compressed Size	8056
Max. Term Depth	8
Asserts	935
Declared Functions	0
Declared Constants	248
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	849	or	1122	and	659	=	2362
/	2	+	134	-	107	*	100
<=	62

Query 3

Status	sat
Inferred Status	None
Size	97515
Compressed Size	8287
Max. Term Depth	8
Asserts	944
Declared Functions	0
Declared Constants	248
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	884	or	1166	and	659	=	2397
/	4	+	187	-	151	*	135
<=	80

Query 4

Status	sat
Inferred Status	None
Size	100548
Compressed Size	8465
Max. Term Depth	8
Asserts	954
Declared Functions	0
Declared Constants	248
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	919	or	1211	and	659	=	2432
/	4	+	242	-	196	*	172
<=	100

Query 5

Status	sat
Inferred Status	None
Size	100633
Compressed Size	8484
Max. Term Depth	8
Asserts	956
Declared Functions	0
Declared Constants	248
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	919	or	1211	and	659	=	2432
/	4	+	242	-	196	*	172
<=	102