Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/corridor/corridor_000_k2_E.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	15850
Compressed Size	2084
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	7

Query 1

Status	sat
Inferred Status	None
Size	8504
Compressed Size	1701
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	9539
Compressed Size	1782
Max. Term Depth	8
Asserts	76
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	54	or	66	and	26	=	132
/	2	+	40	-	33	*	30
<=	18

Query 3

Status	sat
Inferred Status	None
Size	10146
Compressed Size	1847
Max. Term Depth	8
Asserts	78
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	62	or	74	and	28	=	138
/	2	+	50	-	41	*	36
<=	22

Query 4

Status	sat
Inferred Status	None
Size	12089
Compressed Size	1945
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	85	or	103	and	28	=	161
/	2	+	85	-	70	*	59
<=	34

Query 5

Status	unsat
Inferred Status	None
Size	12216
Compressed Size	1982
Max. Term Depth	8
Asserts	87
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	85	or	103	and	28	=	161
/	4	+	85	-	70	*	59
<=	37

Query 6

Status	unsat
Inferred Status	None
Size	15698
Compressed Size	2091
Max. Term Depth	8
Asserts	98
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	128	or	155	and	30	=	202
/	6	+	148	-	122	*	100
<=	59

Query 7

Status	sat
Inferred Status	None
Size	15663
Compressed Size	2046
Max. Term Depth	8
Asserts	97
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	128	or	155	and	30	=	202
/	5	+	148	-	122	*	100
<=	58