Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/grid/grid_02x02_k2_k3_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	12140
Compressed Size	1956
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	7

Query 1

Status	sat
Inferred Status	None
Size	6872
Compressed Size	1574
Max. Term Depth	6
Asserts	60
Declared Functions	0
Declared Constants	55
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	27	or	32	and	9
=	70	let	2	+	18	-	15
*	15	<=	15

Query 2

Status	sat
Inferred Status	None
Size	8235
Compressed Size	1695
Max. Term Depth	8
Asserts	64
Declared Functions	0
Declared Constants	55
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	43	or	52	and	9
=	86	let	2	/	2	+	42
-	35	*	31	<=	23

Query 3

Status	sat
Inferred Status	None
Size	8824
Compressed Size	1773
Max. Term Depth	8
Asserts	66
Declared Functions	0
Declared Constants	55
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	50	or	60	and	10
=	92	let	2	/	2	+	52
-	43	*	37	<=	27

Query 4

Status	sat
Inferred Status	None
Size	9419
Compressed Size	1835
Max. Term Depth	8
Asserts	68
Declared Functions	0
Declared Constants	55
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	57	or	68	and	11
=	98	let	2	/	2	+	62
-	51	*	44	<=	31

Query 5

Status	unsat
Inferred Status	None
Size	9545
Compressed Size	1872
Max. Term Depth	8
Asserts	71
Declared Functions	0
Declared Constants	55
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	57	or	68	and	11
=	98	let	2	/	4	+	62
-	51	*	44	<=	34

Query 6

Status	unsat
Inferred Status	None
Size	11988
Compressed Size	1913
Max. Term Depth	8
Asserts	79
Declared Functions	0
Declared Constants	55
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	87	or	104	and	13
=	126	let	2	/	6	+	106
-	87	*	73	<=	50

Query 7

Status	sat
Inferred Status	None
Size	11954
Compressed Size	1895
Max. Term Depth	8
Asserts	78
Declared Functions	0
Declared Constants	55
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	87	or	104	and	13
=	126	let	2	/	5	+	106
-	87	*	73	<=	49