Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/corridor/corridor_000_k2_F1.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	24368
Compressed Size	2751
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	13

Query 1

Status	sat
Inferred Status	None
Size	5339
Compressed Size	1431
Max. Term Depth	5
Asserts	42
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	19	or	22	and	7	=	49
+	14	-	12	*	12	<=	8

Query 2

Status	sat
Inferred Status	None
Size	6038
Compressed Size	1515
Max. Term Depth	8
Asserts	44
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	27	or	32	and	7	=	57
/	1	+	26	-	22	*	20
<=	12

Query 3

Status	sat
Inferred Status	None
Size	6627
Compressed Size	1575
Max. Term Depth	8
Asserts	46
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	34	or	40	and	8	=	63
/	1	+	36	-	30	*	26
<=	16

Query 4

Status	unsat
Inferred Status	None
Size	7224
Compressed Size	1630
Max. Term Depth	8
Asserts	48
Declared Functions	0
Declared Constants	42
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	41	or	48	and	9	=	69
/	1	+	46	-	38	*	33
<=	20

Query 5

Status	unsat
Inferred Status	None
Size	10682
Compressed Size	1952
Max. Term Depth	8
Asserts	85
Declared Functions	0
Declared Constants	61
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	70	or	83	and	30	=	149
/	1	+	54	-	44	*	39
<=	24

Query 6

Status	sat
Inferred Status	None
Size	14729
Compressed Size	2312
Max. Term Depth	8
Asserts	128
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	105	or	124	and	55	=	243
/	1	+	62	-	50	*	45
<=	28

Query 7

Status	sat
Inferred Status	None
Size	15336
Compressed Size	2349
Max. Term Depth	8
Asserts	130
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	113	or	132	and	57	=	249
/	1	+	72	-	58	*	51
<=	32

Query 8

Status	sat
Inferred Status	None
Size	16035
Compressed Size	2396
Max. Term Depth	8
Asserts	132
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	121	or	142	and	57	=	257
/	2	+	84	-	68	*	59
<=	36

Query 9

Status	sat
Inferred Status	None
Size	16630
Compressed Size	2427
Max. Term Depth	8
Asserts	134
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	128	or	150	and	58	=	263
/	2	+	94	-	76	*	66
<=	40

Query 10

Status	sat
Inferred Status	None
Size	18329
Compressed Size	2557
Max. Term Depth	8
Asserts	139
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	148	or	175	and	58	=	283
/	5	+	124	-	101	*	86
<=	50

Query 11

Status	unsat
Inferred Status	None
Size	18457
Compressed Size	2600
Max. Term Depth	8
Asserts	142
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	148	or	175	and	58	=	283
/	7	+	124	-	101	*	86
<=	53

Query 12

Status	unsat
Inferred Status	None
Size	21918
Compressed Size	2671
Max. Term Depth	8
Asserts	153
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	191	or	226	and	61	=	323
/	11	+	186	-	152	*	127
<=	75

Query 13

Status	sat
Inferred Status	None
Size	21883
Compressed Size	2647
Max. Term Depth	8
Asserts	152
Declared Functions	0
Declared Constants	80
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	191	or	226	and	61	=	323
/	10	+	186	-	152	*	127
<=	74