Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/corridor/corridor_001_k3_C2.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	34666
Compressed Size	3401
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	19921
Compressed Size	2560
Max. Term Depth	6
Asserts	194
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	137	or	163	and	94
=	367	let	2	+	42	-	33
*	33	<=	27

Query 2

Status	sat
Inferred Status	None
Size	20620
Compressed Size	2633
Max. Term Depth	8
Asserts	196
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	145	or	173	and	94
=	375	let	2	/	1	+	54
-	43	*	41	<=	31

Query 3

Status	sat
Inferred Status	None
Size	23557
Compressed Size	2788
Max. Term Depth	8
Asserts	205
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	180	or	217	and	94
=	410	let	2	/	2	+	107
-	86	*	77	<=	49

Query 4

Status	sat
Inferred Status	None
Size	27356
Compressed Size	3000
Max. Term Depth	8
Asserts	217
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	225	or	274	and	94
=	455	let	2	/	3	+	176
-	143	*	122	<=	73

Query 5

Status	sat
Inferred Status	None
Size	33023
Compressed Size	3267
Max. Term Depth	8
Asserts	235
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	292	or	359	and	94
=	522	let	2	/	4	+	279
-	227	*	193	<=	109

Query 6

Status	sat
Inferred Status	None
Size	34518
Compressed Size	3383
Max. Term Depth	8
Asserts	240
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	309	or	381	and	94
=	539	let	2	/	4	+	306
-	249	*	210	<=	119

Query 7

Status	sat
Inferred Status	None
Size	34642
Compressed Size	3416
Max. Term Depth	8
Asserts	243
Declared Functions	0
Declared Constants	115
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	309	or	381	and	94
=	539	let	2	/	6	+	306
-	249	*	210	<=	122