Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/grid/grid_08x08_k5_k2_A.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	1280727
Compressed Size	79066
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	1183112
Compressed Size	76057
Max. Term Depth	34
Asserts	10718
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	10671	or	16350	and	10366
=	33010	let	1	/	4929	+	36
-	28	*	28	<=	22

Query 2

Status	sat
Inferred Status	None
Size	1202443
Compressed Size	76702
Max. Term Depth	34
Asserts	10774
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	10895	or	16630	and	10366
=	33234	let	1	/	5015	+	372
-	309	*	252	<=	134

Query 3

Status	sat
Inferred Status	None
Size	1227543
Compressed Size	77222
Max. Term Depth	34
Asserts	10846
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11183	or	16990	and	10366
=	33522	let	1	/	5123	+	804
-	667	*	540	<=	278

Query 4

Status	sat
Inferred Status	None
Size	1240712
Compressed Size	77672
Max. Term Depth	34
Asserts	10884
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11335	or	17180	and	10366
=	33674	let	1	/	5183	+	1032
-	867	*	692	<=	354

Query 5

Status	sat
Inferred Status	None
Size	1244370
Compressed Size	77828
Max. Term Depth	34
Asserts	10897
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11374	or	17232	and	10366
=	33713	let	1	/	5195	+	1097
-	919	*	731	<=	380

Query 6

Status	sat
Inferred Status	None
Size	1254246
Compressed Size	78118
Max. Term Depth	34
Asserts	10932
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11479	or	17372	and	10366
=	33818	let	1	/	5227	+	1272
-	1066	*	836	<=	450

Query 7

Status	sat
Inferred Status	None
Size	1265900
Compressed Size	78427
Max. Term Depth	34
Asserts	10973
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11602	or	17536	and	10366
=	33941	let	1	/	5259	+	1477
-	1230	*	987	<=	532

Query 8

Status	sat
Inferred Status	None
Size	1269648
Compressed Size	78574
Max. Term Depth	34
Asserts	10986
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11641	or	17588	and	10366
=	33980	let	1	/	5272	+	1542
-	1282	*	1039	<=	558

Query 9

Status	sat
Inferred Status	None
Size	1280454
Compressed Size	79009
Max. Term Depth	34
Asserts	11017
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11765	or	17743	and	10366
=	34104	let	1	/	5332	+	1728
-	1437	*	1163	<=	620

Query 10

Status	sat
Inferred Status	None
Size	1280593
Compressed Size	79049
Max. Term Depth	34
Asserts	11020
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11765	or	17743	and	10366
=	34104	let	1	/	5335	+	1728
-	1437	*	1163	<=	623

Query 11

Status	sat
Inferred Status	None
Size	1280695
Compressed Size	79063
Max. Term Depth	34
Asserts	11022
Declared Functions	0
Declared Constants	386
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

ite	2	not	11765	or	17743	and	10366
=	34104	let	1	/	5337	+	1728
-	1437	*	1163	<=	625