Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/corridor/corridor_001_k2_F.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
Size22852
Compressed Size2922
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 11200
Compressed Size1949
Max. Term Depth6
Asserts 102
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not63 or73 and39 =168
+30 -24 *24 <=16
Query 2
Status sat
Inferred Status None
Size 11849
Compressed Size2047
Max. Term Depth8
Asserts 104
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not71 or82 and40 =175
+41 -33 *31 <=20
Query 3
Status sat
Inferred Status None
Size 12548
Compressed Size2139
Max. Term Depth8
Asserts 106
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not79 or92 and40 =183
/1 +53 -43 *39
<=24
Query 4
Status unsat
Inferred Status None
Size 13145
Compressed Size2194
Max. Term Depth8
Asserts 108
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not86 or100 and41 =189
/1 +63 -51 *46
<=28
Query 5
Status sat
Inferred Status None
Size 18306
Compressed Size2648
Max. Term Depth8
Asserts 164
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not134 or158 and77 =319
/1 +71 -57 *52
<=32
Query 6
Status sat
Inferred Status None
Size 18895
Compressed Size2712
Max. Term Depth8
Asserts 166
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not141 or166 and78 =325
/1 +81 -65 *58
<=36
Query 7
Status sat
Inferred Status None
Size 20594
Compressed Size2840
Max. Term Depth8
Asserts 171
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not161 or191 and78 =345
/4 +111 -90 *78
<=46
Query 8
Status sat
Inferred Status None
Size 20686
Compressed Size2864
Max. Term Depth8
Asserts 173
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not161 or191 and78 =345
/5 +111 -90 *78
<=48