Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/corridor/corridor_001_k2_C2.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	21215
Compressed Size	2504
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	13958
Compressed Size	2115
Max. Term Depth	6
Asserts	130
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	91	or	111	and	65	=	255
+	30	-	24	*	24	<=	16

Query 2

Status	sat
Inferred Status	None
Size	14565
Compressed Size	2193
Max. Term Depth	8
Asserts	132
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	99	or	119	and	67	=	261
+	40	-	32	*	30	<=	20

Query 3

Status	sat
Inferred Status	None
Size	16600
Compressed Size	2333
Max. Term Depth	8
Asserts	138
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	123	or	149	and	67	=	285
/	4	+	76	-	62	*	54
<=	32

Query 4

Status	sat
Inferred Status	None
Size	17171
Compressed Size	2410
Max. Term Depth	8
Asserts	140
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	129	or	157	and	67	=	291
/	4	+	86	-	70	*	60
<=	36

Query 5

Status	unsat
Inferred Status	None
Size	17299
Compressed Size	2453
Max. Term Depth	8
Asserts	143
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	129	or	157	and	67	=	291
/	6	+	86	-	70	*	60
<=	39

Query 6

Status	sat
Inferred Status	None
Size	20406
Compressed Size	2573
Max. Term Depth	8
Asserts	153
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	167	or	203	and	69	=	327
/	10	+	142	-	116	*	96
<=	59

Query 7

Status	sat
Inferred Status	None
Size	21105
Compressed Size	2593
Max. Term Depth	8
Asserts	155
Declared Functions	0
Declared Constants	78
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	175	or	213	and	69	=	335
/	11	+	154	-	126	*	104
<=	63