Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k3_k2_B.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	53060
Compressed Size	4603
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	37939
Compressed Size	3811
Max. Term Depth	10
Asserts	345
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	306	or	437	and	264
=	909	let	1	/	70	+	28
-	22	*	22	<=	18

Query 2

Status	sat
Inferred Status	None
Size	45949
Compressed Size	4186
Max. Term Depth	10
Asserts	369
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	399	or	554	and	264
=	1002	let	1	/	102	+	169
-	136	*	118	<=	66

Query 3

Status	sat
Inferred Status	None
Size	47630
Compressed Size	4288
Max. Term Depth	10
Asserts	375
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	417	or	578	and	264
=	1020	let	1	/	106	+	199
-	160	*	136	<=	78

Query 4

Status	sat
Inferred Status	None
Size	50406
Compressed Size	4457
Max. Term Depth	10
Asserts	383
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	449	or	618	and	264
=	1052	let	1	/	117	+	247
-	202	*	168	<=	94

Query 5

Status	sat
Inferred Status	None
Size	52943
Compressed Size	4580
Max. Term Depth	10
Asserts	392
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	476	or	654	and	264
=	1079	let	1	/	119	+	292
-	239	*	203	<=	112

Query 6

Status	sat
Inferred Status	None
Size	53044
Compressed Size	4612
Max. Term Depth	10
Asserts	394
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	476	or	654	and	264
=	1079	let	1	/	121	+	292
-	239	*	203	<=	114