Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_02x02_k2_k3_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	15170
Compressed Size	2287
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	11816
Compressed Size	1948
Max. Term Depth	6
Asserts	111
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	66	or	82	and	40	=	188
+	33	-	27	*	27	<=	18

Query 2

Status	sat
Inferred Status	None
Size	13179
Compressed Size	2044
Max. Term Depth	8
Asserts	115
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	82	or	102	and	40	=	204
/	2	+	57	-	47	*	43
<=	26

Query 3

Status	sat
Inferred Status	None
Size	13768
Compressed Size	2150
Max. Term Depth	8
Asserts	117
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	89	or	110	and	41	=	210
/	2	+	67	-	55	*	49
<=	30

Query 4

Status	sat
Inferred Status	None
Size	14363
Compressed Size	2214
Max. Term Depth	8
Asserts	119
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	96	or	118	and	42	=	216
/	2	+	77	-	63	*	56
<=	34

Query 5

Status	sat
Inferred Status	None
Size	15062
Compressed Size	2273
Max. Term Depth	8
Asserts	121
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	104	or	128	and	42	=	224
/	3	+	89	-	73	*	64
<=	38

Query 6

Status	sat
Inferred Status	None
Size	15154
Compressed Size	2297
Max. Term Depth	8
Asserts	123
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	104	or	128	and	42	=	224
/	4	+	89	-	73	*	64
<=	40