Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/grid/grid_04x04_k3_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	103454
Compressed Size	8224
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	66795
Compressed Size	6219
Max. Term Depth	11
Asserts	619
Declared Functions	0
Declared Constants	175
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	562	or	806	and	491
=	1676	let	2	/	129	+	42
-	33	*	33	<=	27

Query 2

Status	sat
Inferred Status	None
Size	82313
Compressed Size	6978
Max. Term Depth	11
Asserts	666
Declared Functions	0
Declared Constants	175
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	741	or	1032	and	491
=	1855	let	2	/	176	+	315
-	263	*	220	<=	121

Query 3

Status	sat
Inferred Status	None
Size	89766
Compressed Size	7486
Max. Term Depth	11
Asserts	689
Declared Functions	0
Declared Constants	175
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	827	or	1140	and	492
=	1940	let	2	/	204	+	446
-	368	*	311	<=	167

Query 4

Status	sat
Inferred Status	None
Size	101848
Compressed Size	8124
Max. Term Depth	11
Asserts	727
Declared Functions	0
Declared Constants	175
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	967	or	1317	and	493
=	2079	let	2	/	240	+	661
-	542	*	453	<=	243

Query 5

Status	sat
Inferred Status	None
Size	103181
Compressed Size	8182
Max. Term Depth	11
Asserts	731
Declared Functions	0
Declared Constants	175
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	983	or	1336	and	494
=	2094	let	2	/	243	+	684
-	561	*	468	<=	251

Query 6

Status	sat
Inferred Status	None
Size	103320
Compressed Size	8223
Max. Term Depth	11
Asserts	734
Declared Functions	0
Declared Constants	175
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	983	or	1336	and	494
=	2094	let	2	/	246	+	684
-	561	*	468	<=	254

Query 7

Status	sat
Inferred Status	None
Size	103422
Compressed Size	8232
Max. Term Depth	11
Asserts	736
Declared Functions	0
Declared Constants	175
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	3	not	983	or	1336	and	494
=	2094	let	2	/	248	+	684
-	561	*	468	<=	256