Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k4_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	118057
Compressed Size	8794
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	6

Query 1

Status	sat
Inferred Status	None
Size	85264
Compressed Size	7180
Max. Term Depth	15
Asserts	760
Declared Functions	0
Declared Constants	224
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	4	not	701	or	1053	and	639
=	2166	let	3	/	250	+	40
-	32	*	32	<=	28

Query 2

Status	sat
Inferred Status	None
Size	92155
Compressed Size	7564
Max. Term Depth	15
Asserts	780
Declared Functions	0
Declared Constants	224
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	4	not	781	or	1153	and	639
=	2246	let	3	/	285	+	160
-	132	*	112	<=	68

Query 3

Status	sat
Inferred Status	None
Size	105631
Compressed Size	8124
Max. Term Depth	15
Asserts	819
Declared Functions	0
Declared Constants	224
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	4	not	937	or	1348	and	639
=	2402	let	3	/	343	+	394
-	329	*	268	<=	146

Query 4

Status	sat
Inferred Status	None
Size	108726
Compressed Size	8309
Max. Term Depth	15
Asserts	828
Declared Functions	0
Declared Constants	224
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	4	not	973	or	1393	and	639
=	2438	let	3	/	356	+	448
-	374	*	304	<=	164

Query 5

Status	sat
Inferred Status	None
Size	117938
Compressed Size	8772
Max. Term Depth	15
Asserts	855
Declared Functions	0
Declared Constants	224
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	4	not	1079	or	1526	and	639
=	2544	let	3	/	404	+	608
-	515	*	410	<=	218

Query 6

Status	sat
Inferred Status	None
Size	118041
Compressed Size	8801
Max. Term Depth	15
Asserts	857
Declared Functions	0
Declared Constants	224
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	4	not	1079	or	1526	and	639
=	2544	let	3	/	406	+	608
-	515	*	410	<=	220