Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k2_k6_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
Size79468
Compressed Size7126
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 71796
Compressed Size6596
Max. Term Depth9
Asserts 699
Declared Functions0
Declared Constants250
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not588 or811 and484
=1765 let5 +84 -66
*66 <=54
Query 2
Status sat
Inferred Status None
Size 72403
Compressed Size6685
Max. Term Depth9
Asserts 701
Declared Functions0
Declared Constants250
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not596 or819 and486
=1771 let5 +94 -74
*72 <=58
Query 3
Status sat
Inferred Status None
Size 74110
Compressed Size6765
Max. Term Depth9
Asserts 706
Declared Functions0
Declared Constants250
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not616 or844 and486
=1791 let5 /4 +124
-99 *92 <=68
Query 4
Status sat
Inferred Status None
Size 76819
Compressed Size6927
Max. Term Depth9
Asserts 714
Declared Functions0
Declared Constants250
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not648 or884 and486
=1823 let5 /10 +172
-139 *124 <=84
Query 5
Status sat
Inferred Status None
Size 78196
Compressed Size7017
Max. Term Depth9
Asserts 719
Declared Functions0
Declared Constants250
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not663 or904 and486
=1838 let5 /10 +197
-159 *139 <=94
Query 6
Status sat
Inferred Status None
Size 79363
Compressed Size7105
Max. Term Depth9
Asserts 723
Declared Functions0
Declared Constants250
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not678 or920 and489
=1850 let5 /10 +217
-175 *152 <=102
Query 7
Status sat
Inferred Status None
Size 79452
Compressed Size7127
Max. Term Depth9
Asserts 725
Declared Functions0
Declared Constants250
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not678 or920 and489
=1850 let5 /11 +217
-175 *152 <=104