Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k4_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
Size120446
Compressed Size8885
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 calls6
Query 1
Status sat
Inferred Status None
Size 85115
Compressed Size7139
Max. Term Depth15
Asserts 760
Declared Functions0
Declared Constants224
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not701 or1053 and639 =2166
/250 +44 -36 *36
<=24
Query 2
Status sat
Inferred Status None
Size 92006
Compressed Size7530
Max. Term Depth15
Asserts 780
Declared Functions0
Declared Constants224
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not781 or1153 and639 =2246
/285 +164 -136 *116
<=64
Query 3
Status sat
Inferred Status None
Size 105482
Compressed Size8089
Max. Term Depth15
Asserts 819
Declared Functions0
Declared Constants224
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not937 or1348 and639 =2402
/343 +398 -333 *272
<=142
Query 4
Status sat
Inferred Status None
Size 108577
Compressed Size8281
Max. Term Depth15
Asserts 828
Declared Functions0
Declared Constants224
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not973 or1393 and639 =2438
/356 +452 -378 *308
<=160
Query 5
Status sat
Inferred Status None
Size 120327
Compressed Size8862
Max. Term Depth15
Asserts 862
Declared Functions0
Declared Constants224
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1109 or1563 and639 =2574
/419 +656 -556 *444
<=228
Query 6
Status sat
Inferred Status None
Size 120430
Compressed Size8891
Max. Term Depth15
Asserts 864
Declared Functions0
Declared Constants224
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1109 or1563 and639 =2574
/421 +656 -556 *444
<=230