Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/corridor/corridor_000_k2_D.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	14657
Compressed Size	2032
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	7774
Compressed Size	1652
Max. Term Depth	5
Asserts	67
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	36	or	41	and	18	=	93
+	22	-	18	*	18	<=	12

Query 2

Status	sat
Inferred Status	None
Size	9777
Compressed Size	1773
Max. Term Depth	8
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	60	or	71	and	18	=	117
+	58	-	48	*	42	<=	24

Query 3

Status	sat
Inferred Status	None
Size	10476
Compressed Size	1820
Max. Term Depth	8
Asserts	75
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	68	or	81	and	18	=	125
/	1	+	70	-	58	*	50
<=	28

Query 4

Status	sat
Inferred Status	None
Size	10593
Compressed Size	1853
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	68	or	81	and	18	=	125
/	2	+	70	-	58	*	50
<=	31

Query 5

Status	unsat
Inferred Status	None
Size	11294
Compressed Size	1905
Max. Term Depth	8
Asserts	80
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	76	or	91	and	18	=	133
/	3	+	82	-	68	*	58
<=	35

Query 6

Status	sat
Inferred Status	None
Size	13865
Compressed Size	1919
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	108	or	131	and	18	=	165
/	4	+	130	-	108	*	90
<=	50