Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_08x08_k5_A.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
Size1687762
Compressed Size108706
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 calls7
Query 1
Status sat
Inferred Status None
Size 1669485
Compressed Size107545
Max. Term Depth35
Asserts 15054
Declared Functions0
Declared Constants769
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not14961 or22972 and14534
=46387 let4 /6953 +70
-55 *55 <=45
Query 2
Status sat
Inferred Status None
Size 1669829
Compressed Size107644
Max. Term Depth35
Asserts 15055
Declared Functions0
Declared Constants769
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not14965 or22976 and14535
=46390 let4 /6955 +75
-60 *58 <=47
Query 3
Status sat
Inferred Status None
Size 1672301
Compressed Size107815
Max. Term Depth35
Asserts 15062
Declared Functions0
Declared Constants769
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not14993 or23011 and14535
=46418 let4 /6969 +117
-96 *86 <=61
Query 4
Status sat
Inferred Status None
Size 1682095
Compressed Size108410
Max. Term Depth35
Asserts 15091
Declared Functions0
Declared Constants769
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not15106 or23151 and14537
=46529 let4 /7025 +286
-223 *200 <=119
Query 5
Status sat
Inferred Status None
Size 1682719
Compressed Size108459
Max. Term Depth35
Asserts 15093
Declared Functions0
Declared Constants769
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not15113 or23159 and14538
=46535 let4 /7028 +296
-232 *206 <=123
Query 6
Status sat
Inferred Status None
Size 1687637
Compressed Size108680
Max. Term Depth35
Asserts 15107
Declared Functions0
Declared Constants769
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not15169 or23229 and14538
=46591 let4 /7056 +380
-309 *262 <=151
Query 7
Status sat
Inferred Status None
Size 1687746
Compressed Size108711
Max. Term Depth35
Asserts 15109
Declared Functions0
Declared Constants769
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not15169 or23229 and14538
=46591 let4 /7058 +380
-309 *262 <=153