Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/corridor/corridor_000_k2_I1.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	34763
Compressed Size	3333
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	7774
Compressed Size	1649
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	1770
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	10812
Compressed Size	1838
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	72	or	86	and	18	=	129
/	2	+	76	-	63	*	54
<=	30

Query 4

Status	sat
Inferred Status	None
Size	11407
Compressed Size	1903
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	79	or	94	and	19	=	135
/	2	+	86	-	71	*	61
<=	34

Query 5

Status	sat
Inferred Status	None
Size	12514
Compressed Size	1961
Max. Term Depth	8
Asserts	82
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	91	or	110	and	19	=	147
/	2	+	106	-	87	*	73
<=	42

Query 6

Status	sat
Inferred Status	None
Size	13213
Compressed Size	2006
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	99	or	120	and	19	=	155
/	3	+	118	-	97	*	81
<=	46

Query 7

Status	sat
Inferred Status	None
Size	13808
Compressed Size	2075
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	106	or	128	and	20	=	161
/	3	+	128	-	105	*	88
<=	50

Query 8

Status	unsat
Inferred Status	None
Size	14935
Compressed Size	2124
Max. Term Depth	8
Asserts	90
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	118	or	144	and	20	=	173
/	3	+	148	-	121	*	103
<=	58

Query 9

Status	unsat
Inferred Status	None
Size	18826
Compressed Size	2450
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	154	or	186	and	46	=	269
/	3	+	156	-	127	*	109
<=	62

Query 10

Status	sat
Inferred Status	None
Size	22960
Compressed Size	2782
Max. Term Depth	8
Asserts	178
Declared Functions	0
Declared Constants	98
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	190	or	228	and	72	=	365
/	3	+	164	-	133	*	115
<=	66

Query 11

Status	sat
Inferred Status	None
Size	25951
Compressed Size	2918
Max. Term Depth	8
Asserts	187
Declared Functions	0
Declared Constants	98
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	226	or	273	and	72	=	401
/	4	+	218	-	177	*	151
<=	84

Query 12

Status	sat
Inferred Status	None
Size	27082
Compressed Size	2974
Max. Term Depth	8
Asserts	191
Declared Functions	0
Declared Constants	98
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	238	or	289	and	72	=	413
/	4	+	238	-	193	*	167
<=	92

Query 13

Status	sat
Inferred Status	None
Size	27174
Compressed Size	2997
Max. Term Depth	8
Asserts	193
Declared Functions	0
Declared Constants	98
Declared Sorts	0
Defined Functions	0
Defined Recursive Functions	0
Defined Sorts	0
Constants	0
Declared Datatypes	0

Symbols

not	238	or	289	and	72	=	413
/	5	+	238	-	193	*	167
<=	94