Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_k5_A2.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
Size120737
Compressed Size10011
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 calls8
Query 1
Status sat
Inferred Status None
Size 100302
Compressed Size8643
Max. Term Depth8
Asserts 1004
Declared Functions0
Declared Constants259
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not891 or1206 and728 =2593
+95 -75 *75 <=50
Query 2
Status sat
Inferred Status None
Size 103624
Compressed Size8940
Max. Term Depth8
Asserts 1014
Declared Functions0
Declared Constants259
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not931 or1255 and729 =2632
/6 +154 -124 *114
<=70
Query 3
Status sat
Inferred Status None
Size 107139
Compressed Size9168
Max. Term Depth8
Asserts 1025
Declared Functions0
Declared Constants259
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not974 or1307 and731 =2673
/8 +217 -176 *155
<=92
Query 4
Status sat
Inferred Status None
Size 110217
Compressed Size9396
Max. Term Depth8
Asserts 1035
Declared Functions0
Declared Constants259
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1010 or1352 and732 =2708
/12 +272 -221 *192
<=112
Query 5
Status sat
Inferred Status None
Size 115181
Compressed Size9645
Max. Term Depth8
Asserts 1051
Declared Functions0
Declared Constants259
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1068 or1426 and732 =2766
/14 +362 -295 *254
<=144
Query 6
Status sat
Inferred Status None
Size 118929
Compressed Size9867
Max. Term Depth8
Asserts 1064
Declared Functions0
Declared Constants259
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1110 or1481 and732 =2808
/16 +430 -350 *301
<=170
Query 7
Status sat
Inferred Status None
Size 120628
Compressed Size9968
Max. Term Depth8
Asserts 1069
Declared Functions0
Declared Constants259
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1130 or1506 and732 =2828
/19 +460 -375 *321
<=180
Query 8
Status sat
Inferred Status None
Size 120721
Compressed Size9999
Max. Term Depth8
Asserts 1071
Declared Functions0
Declared Constants259
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1130 or1506 and732 =2828
/20 +460 -375 *321
<=182