Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/grid/grid_04x04_k2_k5_A1.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	114086
Compressed Size	9516
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	11

Query 1

Status	sat
Inferred Status	None
Size	100527
Compressed Size	8557
Max. Term Depth	8
Asserts	1006
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	893	or	1206	and	726
=	2587	let	4	+	90	-	70
*	70	<=	55

Query 2

Status	sat
Inferred Status	None
Size	102573
Compressed Size	8744
Max. Term Depth	8
Asserts	1012
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	917	or	1236	and	726
=	2611	let	4	/	4	+	126
-	100	*	94	<=	67

Query 3

Status	sat
Inferred Status	None
Size	105277
Compressed Size	8886
Max. Term Depth	8
Asserts	1020
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	949	or	1276	and	726
=	2643	let	4	/	9	+	174
-	140	*	126	<=	83

Query 4

Status	sat
Inferred Status	None
Size	110781
Compressed Size	9225
Max. Term Depth	8
Asserts	1038
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	1013	or	1358	and	726
=	2707	let	4	/	11	+	274
-	222	*	190	<=	119

Query 5

Status	sat
Inferred Status	None
Size	111436
Compressed Size	9306
Max. Term Depth	8
Asserts	1040
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	1021	or	1367	and	727
=	2714	let	4	/	11	+	285
-	231	*	197	<=	123

Query 6

Status	sat
Inferred Status	None
Size	112572
Compressed Size	9396
Max. Term Depth	8
Asserts	1044
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	1033	or	1383	and	727
=	2726	let	4	/	11	+	305
-	247	*	212	<=	131

Query 7

Status	sat
Inferred Status	None
Size	113615
Compressed Size	9462
Max. Term Depth	8
Asserts	1047
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	1045	or	1398	and	727
=	2738	let	4	/	13	+	323
-	262	*	224	<=	137

Query 8

Status	sat
Inferred Status	None
Size	113741
Compressed Size	9498
Max. Term Depth	8
Asserts	1050
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	1045	or	1398	and	727
=	2738	let	4	/	15	+	323
-	262	*	224	<=	140

Query 9

Status	sat
Inferred Status	None
Size	113843
Compressed Size	9507
Max. Term Depth	8
Asserts	1052
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	1045	or	1398	and	727
=	2738	let	4	/	17	+	323
-	262	*	224	<=	142

Query 10

Status	sat
Inferred Status	None
Size	113945
Compressed Size	9515
Max. Term Depth	8
Asserts	1054
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	1045	or	1398	and	727
=	2738	let	4	/	19	+	323
-	262	*	224	<=	144

Query 11

Status	sat
Inferred Status	None
Size	114038
Compressed Size	9521
Max. Term Depth	8
Asserts	1056
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	5	not	1045	or	1398	and	727
=	2738	let	4	/	20	+	323
-	262	*	224	<=	146