Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_k5_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	113421
Compressed Size	9319
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	100332
Compressed Size	8498
Max. Term Depth	8
Asserts	1006
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	893	or	1206	and	726	=	2587
+	95	-	75	*	75	<=	50

Query 2

Status	sat
Inferred Status	None
Size	102378
Compressed Size	8686
Max. Term Depth	8
Asserts	1012
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	917	or	1236	and	726	=	2611
/	4	+	131	-	105	*	99
<=	62

Query 3

Status	sat
Inferred Status	None
Size	106082
Compressed Size	8895
Max. Term Depth	8
Asserts	1023
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	961	or	1291	and	726	=	2655
/	11	+	197	-	160	*	143
<=	84

Query 4

Status	sat
Inferred Status	None
Size	112269
Compressed Size	9213
Max. Term Depth	8
Asserts	1042
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1035	or	1384	and	726	=	2729
/	13	+	309	-	253	*	217
<=	122

Query 5

Status	sat
Inferred Status	None
Size	113312
Compressed Size	9293
Max. Term Depth	8
Asserts	1045
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1047	or	1399	and	726	=	2741
/	15	+	327	-	268	*	229
<=	128

Query 6

Status	sat
Inferred Status	None
Size	113405
Compressed Size	9319
Max. Term Depth	8
Asserts	1047
Declared Functions	0
Declared Constants	259
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	1047	or	1399	and	726	=	2741
/	16	+	327	-	268	*	229
<=	130