Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.5/grid/grid_04x04_k2_k7_D.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	309416
Compressed Size	22268
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	189178
Compressed Size	15242
Max. Term Depth	10
Asserts	1921
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	1736	or	2317	and	1403
=	4950	let	6	+	154	-	119
*	119	<=	91

Query 2

Status	sat
Inferred Status	None
Size	207303
Compressed Size	16579
Max. Term Depth	10
Asserts	1976
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	1954	or	2588	and	1405
=	5166	let	6	/	18	+	480
-	387	*	336	<=	201

Query 3

Status	sat
Inferred Status	None
Size	233589
Compressed Size	18016
Max. Term Depth	10
Asserts	2059
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	2267	or	2983	and	1406
=	5478	let	6	/	28	+	958
-	781	*	649	<=	367

Query 4

Status	sat
Inferred Status	None
Size	253339
Compressed Size	19121
Max. Term Depth	10
Asserts	2122
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	2500	or	3277	and	1408
=	5709	let	6	/	34	+	1315
-	1075	*	892	<=	493

Query 5

Status	sat
Inferred Status	None
Size	276781
Compressed Size	20365
Max. Term Depth	10
Asserts	2197
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	2775	or	3627	and	1408
=	5984	let	6	/	44	+	1740
-	1425	*	1170	<=	643

Query 6

Status	sat
Inferred Status	None
Size	284888
Compressed Size	20828
Max. Term Depth	10
Asserts	2224
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	2868	or	3746	and	1409
=	6076	let	6	/	52	+	1886
-	1544	*	1267	<=	697

Query 7

Status	sat
Inferred Status	None
Size	298042
Compressed Size	21556
Max. Term Depth	10
Asserts	2269
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	3019	or	3942	and	1409
=	6227	let	6	/	56	+	2127
-	1739	*	1421	<=	787

Query 8

Status	sat
Inferred Status	None
Size	303149
Compressed Size	21873
Max. Term Depth	10
Asserts	2286
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	3077	or	4017	and	1409
=	6285	let	6	/	60	+	2219
-	1814	*	1483	<=	821

Query 9

Status	sat
Inferred Status	None
Size	308232
Compressed Size	22166
Max. Term Depth	10
Asserts	2303
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	3135	or	4092	and	1409
=	6343	let	6	/	64	+	2311
-	1888	*	1546	<=	855

Query 10

Status	sat
Inferred Status	None
Size	309268
Compressed Size	22238
Max. Term Depth	10
Asserts	2306
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	3147	or	4107	and	1409
=	6355	let	6	/	66	+	2329
-	1903	*	1558	<=	861

Query 11

Status	sat
Inferred Status	None
Size	309392
Compressed Size	22277
Max. Term Depth	10
Asserts	2309
Declared Functions	0
Declared Constants	431
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	7	not	3147	or	4107	and	1409
=	6355	let	6	/	68	+	2329
-	1903	*	1558	<=	864