Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/corridor/corridor_000_k2_H2.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	28258
Compressed Size	2917
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	10

Query 1

Status	sat
Inferred Status	None
Size	8732
Compressed Size	1780
Max. Term Depth	5
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	45	or	53	and	27
=	122	let	1	+	20	-	16
*	16	<=	14

Query 2

Status	sat
Inferred Status	None
Size	9431
Compressed Size	1855
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	53	or	63	and	27
=	130	let	1	/	1	+	32
-	26	*	24	<=	18

Query 3

Status	sat
Inferred Status	None
Size	12178
Compressed Size	1995
Max. Term Depth	8
Asserts	87
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	104	and	27
=	162	let	1	/	1	+	82
-	67	*	56	<=	36

Query 4

Status	unsat
Inferred Status	None
Size	12775
Compressed Size	2088
Max. Term Depth	8
Asserts	89
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	92	or	112	and	28
=	168	let	1	/	1	+	92
-	75	*	63	<=	40

Query 5

Status	sat
Inferred Status	None
Size	16804
Compressed Size	2422
Max. Term Depth	8
Asserts	133
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	128	or	154	and	54
=	264	let	1	/	1	+	100
-	81	*	69	<=	44

Query 6

Status	sat
Inferred Status	None
Size	19575
Compressed Size	2549
Max. Term Depth	8
Asserts	142
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	160	or	195	and	54
=	296	let	1	/	1	+	150
-	122	*	105	<=	62

Query 7

Status	sat
Inferred Status	None
Size	20274
Compressed Size	2603
Max. Term Depth	8
Asserts	144
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	168	or	205	and	54
=	304	let	1	/	2	+	162
-	132	*	113	<=	66

Query 8

Status	unsat
Inferred Status	None
Size	20402
Compressed Size	2644
Max. Term Depth	8
Asserts	147
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	168	or	205	and	54
=	304	let	1	/	4	+	162
-	132	*	113	<=	69

Query 9

Status	unsat
Inferred Status	None
Size	23803
Compressed Size	2744
Max. Term Depth	8
Asserts	158
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	208	or	256	and	54
=	344	let	1	/	5	+	224
-	183	*	157	<=	91

Query 10

Status	sat
Inferred Status	None
Size	23768
Compressed Size	2727
Max. Term Depth	8
Asserts	157
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	208	or	256	and	54
=	344	let	1	/	4	+	224
-	183	*	157	<=	90