Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k3_k5_C.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	204690
Compressed Size	14611
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	10

Query 1

Status	sat
Inferred Status	None
Size	115158
Compressed Size	9762
Max. Term Depth	11
Asserts	1076
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	983	or	1419	and	866	=	2958
/	229	+	75	-	60	*	60
<=	40

Query 2

Status	sat
Inferred Status	None
Size	127239
Compressed Size	10509
Max. Term Depth	11
Asserts	1112
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1127	or	1597	and	868	=	3100
/	254	+	289	-	238	*	202
<=	112

Query 3

Status	sat
Inferred Status	None
Size	137779
Compressed Size	11088
Max. Term Depth	11
Asserts	1143
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1251	or	1750	and	870	=	3222
/	298	+	473	-	391	*	324
<=	174

Query 4

Status	sat
Inferred Status	None
Size	152690
Compressed Size	11919
Max. Term Depth	11
Asserts	1189
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1424	or	1967	and	872	=	3393
/	350	+	736	-	607	*	506
<=	266

Query 5

Status	sat
Inferred Status	None
Size	171877
Compressed Size	12834
Max. Term Depth	11
Asserts	1247
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1650	or	2250	and	873	=	3618
/	398	+	1077	-	890	*	737
<=	382

Query 6

Status	sat
Inferred Status	None
Size	186716
Compressed Size	13789
Max. Term Depth	11
Asserts	1293
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1822	or	2466	and	875	=	3788
/	452	+	1339	-	1108	*	907
<=	474

Query 7

Status	sat
Inferred Status	None
Size	199622
Compressed Size	14353
Max. Term Depth	11
Asserts	1332
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1972	or	2655	and	875	=	3938
/	496	+	1567	-	1297	*	1060
<=	552

Query 8

Status	sat
Inferred Status	None
Size	202138
Compressed Size	14457
Max. Term Depth	11
Asserts	1341
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1999	or	2691	and	875	=	3965
/	502	+	1612	-	1334	*	1087
<=	570

Query 9

Status	sat
Inferred Status	None
Size	204560
Compressed Size	14561
Max. Term Depth	11
Asserts	1348
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2027	or	2726	and	875	=	3993
/	512	+	1654	-	1371	*	1115
<=	584

Query 10

Status	sat
Inferred Status	None
Size	204674
Compressed Size	14603
Max. Term Depth	11
Asserts	1350
Declared Functions	0
Declared Constants	289
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	2027	or	2726	and	875	=	3993
/	514	+	1654	-	1371	*	1115
<=	586