Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/corridor/corridor_001_k3_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
Size32022
Compressed Size3374
License Creative Commons Attribution 4.0 International (CC-BY-4.0)
Categoryindustrial
First Occurrence—
Generated ByTomas Kolarik
Generated On2024-04-14 00:00:00
Generatorgitlab.com/Tomaqa/mapf_r
Dolmen OK1
strict Dolmen OK1
check-sat calls8
Query 1
Status sat
Inferred Status None
Size 19824
Compressed Size2524
Max. Term Depth6
Asserts 194
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not137 or163 and94 =367
+45 -36 *36 <=24
Query 2
Status sat
Inferred Status None
Size 20523
Compressed Size2596
Max. Term Depth8
Asserts 196
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not145 or173 and94 =375
/1 +57 -46 *44
<=28
Query 3
Status sat
Inferred Status None
Size 23190
Compressed Size2768
Max. Term Depth8
Asserts 204
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not177 or213 and94 =407
/2 +105 -86 *76
<=44
Query 4
Status sat
Inferred Status None
Size 25141
Compressed Size2892
Max. Term Depth8
Asserts 210
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not200 or242 and94 =430
/3 +140 -115 *99
<=56
Query 5
Status sat
Inferred Status None
Size 29312
Compressed Size3154
Max. Term Depth8
Asserts 224
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not250 or303 and97 =477
/3 +215 -176 *151
<=84
Query 6
Status sat
Inferred Status None
Size 30419
Compressed Size3244
Max. Term Depth8
Asserts 228
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not262 or319 and97 =489
/3 +235 -192 *163
<=92
Query 7
Status sat
Inferred Status None
Size 31914
Compressed Size3360
Max. Term Depth8
Asserts 233
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not279 or341 and97 =506
/3 +262 -214 *180
<=102
Query 8
Status sat
Inferred Status None
Size 32006
Compressed Size3387
Max. Term Depth8
Asserts 235
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not279 or341 and97 =506
/4 +262 -214 *180
<=104