Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_02x02_k2_k4_unsat_D.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
Size143709
Compressed Size10006
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 15050
Compressed Size2085
Max. Term Depth7
Asserts 147
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not88 or107 and48
=237 let3 +40 -32
*32 <=28
Query 2
Status sat
Inferred Status None
Size 22057
Compressed Size2633
Max. Term Depth8
Asserts 169
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not172 or211 and50
=319 let3 /7 +166
-136 *118 <=72
Query 3
Status sat
Inferred Status None
Size 28060
Compressed Size2923
Max. Term Depth8
Asserts 187
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not244 or301 and50
=391 let3 /15 +274
-226 *190 <=108
Query 4
Status sat
Inferred Status None
Size 33957
Compressed Size3360
Max. Term Depth8
Asserts 207
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not314 or388 and53
=458 let3 /17 +381
-313 *259 <=148
Query 5
Status sat
Inferred Status None
Size 39026
Compressed Size3687
Max. Term Depth8
Asserts 224
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not373 or463 and54
=516 let3 /19 +473
-388 *321 <=182
Query 6
Status sat
Inferred Status None
Size 44547
Compressed Size4099
Max. Term Depth8
Asserts 242
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not438 or545 and55
=580 let3 /23 +573
-470 *387 <=218
Query 7
Status sat
Inferred Status None
Size 48078
Compressed Size4289
Max. Term Depth8
Asserts 254
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not479 or597 and56
=620 let3 /25 +637
-522 *428 <=242
Query 8
Status unsat
Inferred Status None
Size 51991
Compressed Size4504
Max. Term Depth8
Asserts 267
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not525 or655 and57
=665 let3 /26 +708
-580 *474 <=268
Query 9
Status unsat
Inferred Status None
Size 60451
Compressed Size5060
Max. Term Depth8
Asserts 359
Declared Functions0
Declared Constants137
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not601 or751 and113
=881 let3 /26 +724
-592 *486 <=276
Query 10
Status unsat
Inferred Status None
Size 69147
Compressed Size5670
Max. Term Depth8
Asserts 451
Declared Functions0
Declared Constants170
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not677 or847 and169
=1097 let3 /26 +740
-604 *498 <=284
Query 11
Status unsat
Inferred Status None
Size 77843
Compressed Size6126
Max. Term Depth8
Asserts 543
Declared Functions0
Declared Constants203
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not753 or943 and225
=1313 let3 /26 +756
-616 *510 <=292
Query 12
Status unsat
Inferred Status None
Size 86539
Compressed Size6527
Max. Term Depth8
Asserts 635
Declared Functions0
Declared Constants236
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not829 or1039 and281
=1529 let3 /26 +772
-628 *522 <=300
Query 13
Status unsat
Inferred Status None
Size 95235
Compressed Size6943
Max. Term Depth8
Asserts 727
Declared Functions0
Declared Constants269
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not905 or1135 and337
=1745 let3 /26 +788
-640 *534 <=308
Query 14
Status unsat
Inferred Status None
Size 103931
Compressed Size7337
Max. Term Depth8
Asserts 819
Declared Functions0
Declared Constants302
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not981 or1231 and393
=1961 let3 /26 +804
-652 *546 <=316