Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/corridor/corridor_000_k2_I2.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
Size51973
Compressed Size4245
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 calls20
Query 1
Status sat
Inferred Status None
Size 7828
Compressed Size1681
Max. Term Depth5
Asserts 67
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not36 or41 and18
=93 let1 +20 -16
*16 <=14
Query 2
Status sat
Inferred Status None
Size 10653
Compressed Size1878
Max. Term Depth8
Asserts 76
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not69 or83 and18
=126 let1 +71 -58
*52 <=32
Query 3
Status sat
Inferred Status None
Size 11352
Compressed Size1924
Max. Term Depth8
Asserts 78
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not77 or93 and18
=134 let1 /1 +83
-68 *60 <=36
Query 4
Status sat
Inferred Status None
Size 11947
Compressed Size1984
Max. Term Depth8
Asserts 80
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not84 or101 and19
=140 let1 /1 +93
-76 *67 <=40
Query 5
Status sat
Inferred Status None
Size 13054
Compressed Size2039
Max. Term Depth8
Asserts 84
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not96 or117 and19
=152 let1 /1 +113
-92 *79 <=48
Query 6
Status sat
Inferred Status None
Size 14089
Compressed Size2123
Max. Term Depth8
Asserts 87
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not108 or132 and19
=164 let1 /3 +131
-107 *91 <=54
Query 7
Status unsat
Inferred Status None
Size 14686
Compressed Size2176
Max. Term Depth8
Asserts 89
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not115 or140 and20
=170 let1 /3 +141
-115 *98 <=58
Query 8
Status unsat
Inferred Status None
Size 18612
Compressed Size2500
Max. Term Depth8
Asserts 133
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not151 or182 and46
=266 let1 /3 +149
-121 *104 <=62
Query 9
Status sat
Inferred Status None
Size 22749
Compressed Size2869
Max. Term Depth8
Asserts 177
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not187 or224 and72
=362 let1 /3 +157
-127 *110 <=66
Query 10
Status sat
Inferred Status None
Size 25752
Compressed Size3002
Max. Term Depth8
Asserts 186
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not223 or269 and72
=398 let1 /5 +211
-172 *146 <=84
Query 11
Status sat
Inferred Status None
Size 26865
Compressed Size3085
Max. Term Depth8
Asserts 190
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not235 or285 and72
=410 let1 /5 +231
-188 *159 <=92
Query 12
Status sat
Inferred Status None
Size 27454
Compressed Size3114
Max. Term Depth8
Asserts 192
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not242 or293 and73
=416 let1 /5 +241
-196 *165 <=96
Query 13
Status sat
Inferred Status None
Size 28153
Compressed Size3163
Max. Term Depth8
Asserts 194
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not250 or303 and73
=424 let1 /6 +253
-206 *173 <=100
Query 14
Status sat
Inferred Status None
Size 28748
Compressed Size3213
Max. Term Depth8
Asserts 196
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not257 or311 and74
=430 let1 /6 +263
-214 *180 <=104
Query 15
Status sat
Inferred Status None
Size 29873
Compressed Size3258
Max. Term Depth8
Asserts 200
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not269 or327 and74
=442 let1 /6 +283
-230 *195 <=112
Query 16
Status sat
Inferred Status None
Size 30572
Compressed Size3291
Max. Term Depth8
Asserts 202
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not277 or337 and74
=450 let1 /7 +295
-240 *203 <=116
Query 17
Status unsat
Inferred Status None
Size 30699
Compressed Size3328
Max. Term Depth8
Asserts 205
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not277 or337 and74
=450 let1 /9 +295
-240 *203 <=119
Query 18
Status sat
Inferred Status None
Size 38278
Compressed Size3661
Max. Term Depth8
Asserts 230
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not367 or450 and76
=538 let1 /13 +433
-353 *296 <=169
Query 19
Status unsat
Inferred Status None
Size 41379
Compressed Size3847
Max. Term Depth8
Asserts 240
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not403 or496 and76
=574 let1 /13 +489
-399 *336 <=189
Query 20
Status sat
Inferred Status None
Size 41308
Compressed Size3831
Max. Term Depth8
Asserts 239
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not403 or496 and76
=574 let1 /12 +489
-399 *336 <=188