Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/corridor/corridor_000_k2_H2.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	20197
Compressed Size	2530
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	8678
Compressed Size	1744
Max. Term Depth	5
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	45	or	53	and	27	=	122
+	22	-	18	*	18	<=	12

Query 2

Status	sat
Inferred Status	None
Size	9377
Compressed Size	1820
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	53	or	63	and	27	=	130
/	1	+	34	-	28	*	26
<=	16

Query 3

Status	sat
Inferred Status	None
Size	11320
Compressed Size	1911
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	76	or	92	and	27	=	153
/	1	+	69	-	57	*	49
<=	28

Query 4

Status	unsat
Inferred Status	None
Size	11917
Compressed Size	1988
Max. Term Depth	8
Asserts	86
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	83	or	100	and	28	=	159
/	1	+	79	-	65	*	56
<=	32

Query 5

Status	sat
Inferred Status	None
Size	15946
Compressed Size	2345
Max. Term Depth	8
Asserts	130
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	119	or	142	and	54	=	255
/	1	+	87	-	71	*	62
<=	36

Query 6

Status	sat
Inferred Status	None
Size	16645
Compressed Size	2404
Max. Term Depth	8
Asserts	132
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	127	or	152	and	54	=	263
/	2	+	99	-	81	*	70
<=	40

Query 7

Status	sat
Inferred Status	None
Size	16737
Compressed Size	2429
Max. Term Depth	8
Asserts	134
Declared Functions	0
Declared Constants	79
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	127	or	152	and	54	=	263
/	3	+	99	-	81	*	70
<=	42