Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_08x08_k4_k2_A.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	835659
Compressed Size	52876
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	9

Query 1

Status	sat
Inferred Status	None
Size	787474
Compressed Size	51164
Max. Term Depth	18
Asserts	7207
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7152	or	10964	and	6799
=	22288	let	1	/	2936	+	44
-	34	*	34	<=	26

Query 2

Status	sat
Inferred Status	None
Size	799125
Compressed Size	51611
Max. Term Depth	18
Asserts	7241
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7288	or	11134	and	6799
=	22424	let	1	/	2979	+	248
-	201	*	170	<=	94

Query 3

Status	sat
Inferred Status	None
Size	812700
Compressed Size	52024
Max. Term Depth	18
Asserts	7280
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7444	or	11329	and	6799
=	22580	let	1	/	3033	+	482
-	397	*	326	<=	172

Query 4

Status	sat
Inferred Status	None
Size	819641
Compressed Size	52271
Max. Term Depth	18
Asserts	7300
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7524	or	11429	and	6799
=	22660	let	1	/	3063	+	602
-	503	*	406	<=	212

Query 5

Status	sat
Inferred Status	None
Size	821621
Compressed Size	52341
Max. Term Depth	18
Asserts	7307
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7545	or	11457	and	6799
=	22681	let	1	/	3069	+	637
-	531	*	427	<=	226

Query 6

Status	sat
Inferred Status	None
Size	827105
Compressed Size	52500
Max. Term Depth	18
Asserts	7326
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7602	or	11533	and	6799
=	22738	let	1	/	3087	+	732
-	610	*	500	<=	264

Query 7

Status	sat
Inferred Status	None
Size	833517
Compressed Size	52732
Max. Term Depth	18
Asserts	7349
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7671	or	11625	and	6799
=	22807	let	1	/	3101	+	847
-	702	*	569	<=	310

Query 8

Status	sat
Inferred Status	None
Size	835539
Compressed Size	52830
Max. Term Depth	18
Asserts	7356
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7692	or	11653	and	6799
=	22828	let	1	/	3107	+	882
-	730	*	597	<=	324

Query 9

Status	sat
Inferred Status	None
Size	835643
Compressed Size	52859
Max. Term Depth	18
Asserts	7358
Declared Functions	0
Declared Constants	270
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	7692	or	11653	and	6799
=	22828	let	1	/	3109	+	882
-	730	*	597	<=	326