Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/corridor/corridor_000_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	13923
Compressed Size	2009
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	8504
Compressed Size	1700
Max. Term Depth	6
Asserts	73
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	42	or	51	and	26	=	120
+	22	-	18	*	18	<=	12

Query 2

Status	sat
Inferred Status	None
Size	9867
Compressed Size	1822
Max. Term Depth	8
Asserts	77
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	58	or	71	and	26	=	136
/	2	+	46	-	38	*	34
<=	20

Query 3

Status	sat
Inferred Status	None
Size	10474
Compressed Size	1888
Max. Term Depth	8
Asserts	79
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	66	or	79	and	28	=	142
/	2	+	56	-	46	*	40
<=	24

Query 4

Status	sat
Inferred Status	None
Size	11173
Compressed Size	1910
Max. Term Depth	8
Asserts	81
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	74	or	89	and	28	=	150
/	3	+	68	-	56	*	48
<=	28

Query 5

Status	unsat
Inferred Status	None
Size	11292
Compressed Size	1935
Max. Term Depth	8
Asserts	84
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	74	or	89	and	28	=	150
/	4	+	68	-	56	*	48
<=	31

Query 6

Status	sat
Inferred Status	None
Size	13830
Compressed Size	1977
Max. Term Depth	8
Asserts	91
Declared Functions	0
Declared Constants	60
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	106	or	127	and	30	=	180
/	7	+	114	-	94	*	78
<=	46