Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.5/corridor/corridor_000_k2_H1.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	26658
Compressed Size	2872
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	12

Query 1

Status	sat
Inferred Status	None
Size	7782
Compressed Size	1654
Max. Term Depth	6
Asserts	66
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	35	or	41	and	19	=	96
+	22	-	18	*	18	<=	12

Query 2

Status	sat
Inferred Status	None
Size	8431
Compressed Size	1761
Max. Term Depth	8
Asserts	68
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	43	or	50	and	20	=	103
+	33	-	27	*	25	<=	16

Query 3

Status	sat
Inferred Status	None
Size	9130
Compressed Size	1812
Max. Term Depth	8
Asserts	70
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	51	or	60	and	20	=	111
/	1	+	45	-	37	*	33
<=	20

Query 4

Status	unsat
Inferred Status	None
Size	9727
Compressed Size	1873
Max. Term Depth	8
Asserts	72
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	58	or	68	and	21	=	117
/	1	+	55	-	45	*	40
<=	24

Query 5

Status	sat
Inferred Status	None
Size	13669
Compressed Size	2200
Max. Term Depth	8
Asserts	115
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	93	or	109	and	46	=	211
/	1	+	63	-	51	*	46
<=	28

Query 6

Status	sat
Inferred Status	None
Size	14276
Compressed Size	2250
Max. Term Depth	8
Asserts	117
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	101	or	117	and	48	=	217
/	1	+	73	-	59	*	52
<=	32

Query 7

Status	sat
Inferred Status	None
Size	15865
Compressed Size	2354
Max. Term Depth	8
Asserts	122
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	120	or	140	and	49	=	235
/	3	+	101	-	82	*	70
<=	42

Query 8

Status	sat
Inferred Status	None
Size	17808
Compressed Size	2469
Max. Term Depth	8
Asserts	128
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	143	or	169	and	49	=	258
/	3	+	136	-	111	*	93
<=	54

Query 9

Status	sat
Inferred Status	None
Size	18385
Compressed Size	2508
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	149	or	177	and	49	=	264
/	3	+	146	-	119	*	100
<=	58

Query 10

Status	sat
Inferred Status	None
Size	19084
Compressed Size	2565
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	157	or	187	and	49	=	272
/	4	+	158	-	129	*	108
<=	62

Query 11

Status	unsat
Inferred Status	None
Size	19201
Compressed Size	2598
Max. Term Depth	8
Asserts	135
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	157	or	187	and	49	=	272
/	5	+	158	-	129	*	108
<=	65

Query 12

Status	sat
Inferred Status	None
Size	24408
Compressed Size	2676
Max. Term Depth	8
Asserts	151
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	221	or	265	and	52	=	333
/	7	+	253	-	207	*	170
<=	98