Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k3_k2_B.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	42855
Compressed Size	4048
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	5

Query 1

Status	sat
Inferred Status	None
Size	37882
Compressed Size	3778
Max. Term Depth	10
Asserts	345
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	306	or	437	and	264	=	909
/	70	+	30	-	24	*	24
<=	16

Query 2

Status	sat
Inferred Status	None
Size	41005
Compressed Size	3943
Max. Term Depth	10
Asserts	354
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	342	or	482	and	264	=	945
/	86	+	84	-	69	*	60
<=	34

Query 3

Status	sat
Inferred Status	None
Size	41861
Compressed Size	3986
Max. Term Depth	10
Asserts	357
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	351	or	494	and	264	=	954
/	88	+	99	-	81	*	69
<=	40

Query 4

Status	sat
Inferred Status	None
Size	42734
Compressed Size	4034
Max. Term Depth	10
Asserts	360
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	360	or	506	and	264	=	963
/	90	+	114	-	93	*	81
<=	46

Query 5

Status	sat
Inferred Status	None
Size	42839
Compressed Size	4062
Max. Term Depth	10
Asserts	362
Declared Functions	0
Declared Constants	118
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	360	or	506	and	264	=	963
/	92	+	114	-	93	*	81
<=	48