Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.5/corridor/corridor_000_k2_D.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	16355
Compressed Size	2135
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	7828
Compressed Size	1681
Max. Term Depth	5
Asserts	67
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	36	or	41	and	18
=	93	let	1	+	20	-	16
*	16	<=	14

Query 2

Status	sat
Inferred Status	None
Size	10653
Compressed Size	1877
Max. Term Depth	8
Asserts	76
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	69	or	83	and	18
=	126	let	1	+	71	-	58
*	52	<=	32

Query 3

Status	sat
Inferred Status	None
Size	11352
Compressed Size	1914
Max. Term Depth	8
Asserts	78
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	77	or	93	and	18
=	134	let	1	/	1	+	83
-	68	*	60	<=	36

Query 4

Status	sat
Inferred Status	None
Size	11469
Compressed Size	1939
Max. Term Depth	8
Asserts	81
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	77	or	93	and	18
=	134	let	1	/	2	+	83
-	68	*	60	<=	39

Query 5

Status	unsat
Inferred Status	None
Size	12170
Compressed Size	1983
Max. Term Depth	8
Asserts	83
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	85	or	103	and	18
=	142	let	1	/	3	+	95
-	78	*	68	<=	43

Query 6

Status	sat
Inferred Status	None
Size	15563
Compressed Size	2008
Max. Term Depth	8
Asserts	93
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	126	or	155	and	18
=	183	let	1	/	4	+	158
-	130	*	112	<=	64