Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_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	27296
Compressed Size	3227
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	22124
Compressed Size	2787
Max. Term Depth	6
Asserts	211
Declared Functions	0
Declared Constants	86
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	172	or	227	and	132	=	487
+	30	-	24	*	24	<=	16

Query 2

Status	sat
Inferred Status	None
Size	23841
Compressed Size	2915
Max. Term Depth	8
Asserts	216
Declared Functions	0
Declared Constants	86
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	192	or	252	and	132	=	507
/	4	+	60	-	49	*	44
<=	26

Query 3

Status	sat
Inferred Status	None
Size	24492
Compressed Size	3000
Max. Term Depth	8
Asserts	218
Declared Functions	0
Declared Constants	86
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	200	or	261	and	133	=	514
/	4	+	71	-	58	*	51
<=	30

Query 4

Status	sat
Inferred Status	None
Size	25145
Compressed Size	3044
Max. Term Depth	8
Asserts	220
Declared Functions	0
Declared Constants	86
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	208	or	270	and	134	=	521
/	4	+	82	-	67	*	58
<=	34

Query 5

Status	sat
Inferred Status	None
Size	27188
Compressed Size	3210
Max. Term Depth	8
Asserts	226
Declared Functions	0
Declared Constants	86
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	232	or	300	and	134	=	545
/	8	+	118	-	97	*	82
<=	46

Query 6

Status	sat
Inferred Status	None
Size	27280
Compressed Size	3234
Max. Term Depth	8
Asserts	228
Declared Functions	0
Declared Constants	86
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	232	or	300	and	134	=	545
/	9	+	118	-	97	*	82
<=	48