Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_k6_A1.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	140798
Compressed Size	11121
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	114847
Compressed Size	9811
Max. Term Depth	9
Asserts	1150
Declared Functions	0
Declared Constants	310
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1015	or	1371	and	828	=	2952
+	114	-	90	*	90	<=	60

Query 2

Status	sat
Inferred Status	None
Size	126332
Compressed Size	10278
Max. Term Depth	9
Asserts	1185
Declared Functions	0
Declared Constants	310
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1155	or	1544	and	830	=	3090
/	6	+	322	-	263	*	228
<=	130

Query 3

Status	sat
Inferred Status	None
Size	135424
Compressed Size	10728
Max. Term Depth	9
Asserts	1213
Declared Functions	0
Declared Constants	310
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1265	or	1681	and	831	=	3199
/	8	+	487	-	400	*	337
<=	186

Query 4

Status	sat
Inferred Status	None
Size	138460
Compressed Size	10894
Max. Term Depth	9
Asserts	1222
Declared Functions	0
Declared Constants	310
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1301	or	1726	and	831	=	3235
/	14	+	541	-	445	*	373
<=	204

Query 5

Status	sat
Inferred Status	None
Size	140689
Compressed Size	10989
Max. Term Depth	9
Asserts	1229
Declared Functions	0
Declared Constants	310
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1328	or	1759	and	832	=	3261
/	14	+	581	-	478	*	399
<=	218

Query 6

Status	sat
Inferred Status	None
Size	140782
Compressed Size	11018
Max. Term Depth	9
Asserts	1231
Declared Functions	0
Declared Constants	310
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1328	or	1759	and	832	=	3261
/	15	+	581	-	478	*	399
<=	220