Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/corridor/corridor_000_k2_F1.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
Size31898
Compressed Size3183
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 calls16
Query 1
Status sat
Inferred Status None
Size 5393
Compressed Size1464
Max. Term Depth5
Asserts 42
Declared Functions0
Declared Constants42
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not19 or22 and7
=49 let1 +12 -10
*10 <=10
Query 2
Status sat
Inferred Status None
Size 6092
Compressed Size1544
Max. Term Depth8
Asserts 44
Declared Functions0
Declared Constants42
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not27 or32 and7
=57 let1 /1 +24
-20 *18 <=14
Query 3
Status sat
Inferred Status None
Size 6681
Compressed Size1606
Max. Term Depth8
Asserts 46
Declared Functions0
Declared Constants42
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not34 or40 and8
=63 let1 /1 +34
-28 *24 <=18
Query 4
Status unsat
Inferred Status None
Size 7278
Compressed Size1661
Max. Term Depth8
Asserts 48
Declared Functions0
Declared Constants42
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not41 or48 and9
=69 let1 /1 +44
-36 *31 <=22
Query 5
Status unsat
Inferred Status None
Size 10736
Compressed Size1980
Max. Term Depth8
Asserts 85
Declared Functions0
Declared Constants61
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not70 or83 and30
=149 let1 /1 +52
-42 *37 <=26
Query 6
Status sat
Inferred Status None
Size 14783
Compressed Size2341
Max. Term Depth8
Asserts 128
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not105 or124 and55
=243 let1 /1 +60
-48 *43 <=30
Query 7
Status sat
Inferred Status None
Size 15390
Compressed Size2382
Max. Term Depth8
Asserts 130
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not113 or132 and57
=249 let1 /1 +70
-56 *49 <=34
Query 8
Status sat
Inferred Status None
Size 16089
Compressed Size2427
Max. Term Depth8
Asserts 132
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not121 or142 and57
=257 let1 /2 +82
-66 *57 <=38
Query 9
Status sat
Inferred Status None
Size 16684
Compressed Size2459
Max. Term Depth8
Asserts 134
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not128 or150 and58
=263 let1 /2 +92
-74 *64 <=42
Query 10
Status sat
Inferred Status None
Size 17383
Compressed Size2525
Max. Term Depth8
Asserts 136
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not136 or160 and58
=271 let1 /3 +104
-84 *72 <=46
Query 11
Status unsat
Inferred Status None
Size 17511
Compressed Size2566
Max. Term Depth8
Asserts 139
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not136 or160 and58
=271 let1 /5 +104
-84 *72 <=49
Query 12
Status sat
Inferred Status None
Size 19969
Compressed Size2622
Max. Term Depth8
Asserts 147
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not167 or196 and61
=299 let1 /7 +148
-120 *101 <=65
Query 13
Status sat
Inferred Status None
Size 21004
Compressed Size2700
Max. Term Depth8
Asserts 150
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not179 or211 and61
=311 let1 /9 +166
-135 *113 <=71
Query 14
Status sat
Inferred Status None
Size 21703
Compressed Size2742
Max. Term Depth8
Asserts 152
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not187 or221 and61
=319 let1 /10 +178
-145 *121 <=75
Query 15
Status unsat
Inferred Status None
Size 24708
Compressed Size2862
Max. Term Depth8
Asserts 161
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not223 or266 and61
=355 let1 /12 +232
-190 *157 <=93
Query 16
Status sat
Inferred Status None
Size 24569
Compressed Size2828
Max. Term Depth8
Asserts 160
Declared Functions0
Declared Constants80
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not223 or266 and61
=355 let1 /11 +232
-190 *157 <=92