Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/corridor/corridor_000_k2_F2.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
Size26855
Compressed Size2926
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 calls14
Query 1
Status sat
Inferred Status None
Size 5339
Compressed Size1432
Max. Term Depth5
Asserts 42
Declared Functions0
Declared Constants42
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not19 or22 and7 =49
+14 -12 *12 <=8
Query 2
Status sat
Inferred Status None
Size 6038
Compressed Size1516
Max. Term Depth8
Asserts 44
Declared Functions0
Declared Constants42
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not27 or32 and7 =57
/1 +26 -22 *20
<=12
Query 3
Status sat
Inferred Status None
Size 6627
Compressed Size1578
Max. Term Depth8
Asserts 46
Declared Functions0
Declared Constants42
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not34 or40 and8 =63
/1 +36 -30 *26
<=16
Query 4
Status unsat
Inferred Status None
Size 7224
Compressed Size1633
Max. Term Depth8
Asserts 48
Declared Functions0
Declared Constants42
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not41 or48 and9 =69
/1 +46 -38 *33
<=20
Query 5
Status unsat
Inferred Status None
Size 10682
Compressed Size1949
Max. Term Depth8
Asserts 85
Declared Functions0
Declared Constants61
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not70 or83 and30 =149
/1 +54 -44 *39
<=24
Query 6
Status sat
Inferred Status None
Size 14729
Compressed Size2274
Max. Term Depth8
Asserts 128
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not105 or124 and55 =243
/1 +62 -50 *45
<=28
Query 7
Status sat
Inferred Status None
Size 15336
Compressed Size2316
Max. Term Depth8
Asserts 130
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not113 or132 and57 =249
/1 +72 -58 *51
<=32
Query 8
Status sat
Inferred Status None
Size 16035
Compressed Size2380
Max. Term Depth8
Asserts 132
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not121 or142 and57 =257
/2 +84 -68 *59
<=36
Query 9
Status sat
Inferred Status None
Size 16606
Compressed Size2429
Max. Term Depth8
Asserts 134
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not127 or150 and57 =263
/2 +94 -76 *65
<=40
Query 10
Status sat
Inferred Status None
Size 18555
Compressed Size2553
Max. Term Depth8
Asserts 140
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not150 or179 and57 =286
/2 +129 -105 *89
<=52
Query 11
Status sat
Inferred Status None
Size 19590
Compressed Size2616
Max. Term Depth8
Asserts 143
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not162 or194 and57 =298
/4 +147 -120 *101
<=58
Query 12
Status unsat
Inferred Status None
Size 19718
Compressed Size2660
Max. Term Depth8
Asserts 146
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not162 or194 and57 =298
/6 +147 -120 *101
<=61
Query 13
Status unsat
Inferred Status None
Size 24405
Compressed Size2799
Max. Term Depth8
Asserts 161
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not219 or264 and59 =353
/9 +232 -190 *157
<=91
Query 14
Status sat
Inferred Status None
Size 24370
Compressed Size2779
Max. Term Depth8
Asserts 160
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not219 or264 and59 =353
/8 +232 -190 *157
<=90