Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_08x08_k4_k2_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
Size825637
Compressed Size52510
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 787414
Compressed Size51126
Max. Term Depth18
Asserts 7207
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not7152 or10964 and6799 =22288
/2936 +46 -36 *36
<=24
Query 2
Status sat
Inferred Status None
Size 799065
Compressed Size51579
Max. Term Depth18
Asserts 7241
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not7288 or11134 and6799 =22424
/2979 +250 -203 *172
<=92
Query 3
Status sat
Inferred Status None
Size 812640
Compressed Size51988
Max. Term Depth18
Asserts 7280
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not7444 or11329 and6799 =22580
/3033 +484 -399 *328
<=170
Query 4
Status sat
Inferred Status None
Size 819581
Compressed Size52234
Max. Term Depth18
Asserts 7300
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not7524 or11429 and6799 =22660
/3063 +604 -505 *408
<=210
Query 5
Status sat
Inferred Status None
Size 825513
Compressed Size52454
Max. Term Depth18
Asserts 7317
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not7592 or11514 and6799 =22728
/3095 +706 -590 *476
<=244
Query 6
Status sat
Inferred Status None
Size 825621
Compressed Size52489
Max. Term Depth18
Asserts 7319
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not7592 or11514 and6799 =22728
/3097 +706 -590 *476
<=246