Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.5/grid/grid_02x02_k2_k3_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	48069
Compressed Size	4126
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	11

Query 1

Status	sat
Inferred Status	None
Size	11723
Compressed Size	1869
Max. Term Depth	6
Asserts	111
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	66	or	80	and	36
=	178	let	2	+	30	-	24
*	24	<=	21

Query 2

Status	sat
Inferred Status	None
Size	15842
Compressed Size	2259
Max. Term Depth	8
Asserts	124
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	115	or	141	and	37
=	226	let	2	/	3	+	104
-	85	*	75	<=	47

Query 3

Status	sat
Inferred Status	None
Size	17759
Compressed Size	2374
Max. Term Depth	8
Asserts	130
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	138	or	169	and	38
=	248	let	2	/	5	+	138
-	113	*	97	<=	59

Query 4

Status	sat
Inferred Status	None
Size	21324
Compressed Size	2560
Max. Term Depth	8
Asserts	141
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	181	or	222	and	39
=	290	let	2	/	8	+	202
-	166	*	139	<=	81

Query 5

Status	sat
Inferred Status	None
Size	23967
Compressed Size	2719
Max. Term Depth	8
Asserts	150
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	211	or	261	and	39
=	320	let	2	/	10	+	250
-	205	*	169	<=	99

Query 6

Status	sat
Inferred Status	None
Size	25476
Compressed Size	2788
Max. Term Depth	8
Asserts	155
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	228	or	283	and	39
=	337	let	2	/	11	+	277
-	227	*	187	<=	109

Query 7

Status	sat
Inferred Status	None
Size	27649
Compressed Size	2874
Max. Term Depth	8
Asserts	162
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	253	or	315	and	39
=	362	let	2	/	13	+	316
-	259	*	213	<=	123

Query 8

Status	sat
Inferred Status	None
Size	29244
Compressed Size	2958
Max. Term Depth	8
Asserts	167
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	272	or	338	and	40
=	380	let	2	/	15	+	344
-	282	*	232	<=	133

Query 9

Status	sat
Inferred Status	None
Size	29361
Compressed Size	2992
Max. Term Depth	8
Asserts	170
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	272	or	338	and	40
=	380	let	2	/	16	+	344
-	282	*	232	<=	136

Query 10

Status	unsat
Inferred Status	None
Size	30062
Compressed Size	3039
Max. Term Depth	8
Asserts	172
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	280	or	348	and	40
=	388	let	2	/	17	+	356
-	292	*	240	<=	140

Query 11

Status	sat
Inferred Status	None
Size	47277
Compressed Size	3896
Max. Term Depth	8
Asserts	227
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	486	or	606	and	44
=	590	let	2	/	32	+	670
-	550	*	448	<=	251