Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k2_k6_D.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
Size189770
Compressed Size14801
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 calls11
Query 1
Status sat
Inferred Status None
Size 156902
Compressed Size12663
Max. Term Depth9
Asserts 1591
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1432 or1907 and1154
=4075 let5 +132 -102
*102 <=78
Query 2
Status sat
Inferred Status None
Size 166445
Compressed Size13500
Max. Term Depth9
Asserts 1620
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1547 or2049 and1156
=4188 let5 /11 +303
-242 *216 <=136
Query 3
Status sat
Inferred Status None
Size 171453
Compressed Size13817
Max. Term Depth9
Asserts 1637
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1605 or2123 and1157
=4245 let5 /11 +394
-316 *273 <=170
Query 4
Status sat
Inferred Status None
Size 175141
Compressed Size13976
Max. Term Depth9
Asserts 1648
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1649 or2178 and1157
=4289 let5 /13 +460
-371 *317 <=192
Query 5
Status sat
Inferred Status None
Size 176858
Compressed Size14063
Max. Term Depth9
Asserts 1653
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1669 or2203 and1157
=4309 let5 /17 +490
-396 *337 <=202
Query 6
Status sat
Inferred Status None
Size 178242
Compressed Size14140
Max. Term Depth9
Asserts 1658
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1684 or2223 and1157
=4324 let5 /17 +515
-416 *353 <=212
Query 7
Status sat
Inferred Status None
Size 185828
Compressed Size14510
Max. Term Depth9
Asserts 1682
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1775 or2335 and1160
=4412 let5 /19 +651
-528 *446 <=260
Query 8
Status sat
Inferred Status None
Size 187229
Compressed Size14584
Max. Term Depth9
Asserts 1687
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1790 or2355 and1160
=4427 let5 /19 +676
-548 *465 <=270
Query 9
Status sat
Inferred Status None
Size 188616
Compressed Size14655
Max. Term Depth9
Asserts 1692
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1805 or2375 and1160
=4442 let5 /19 +701
-568 *480 <=280
Query 10
Status sat
Inferred Status None
Size 189662
Compressed Size14717
Max. Term Depth9
Asserts 1695
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1817 or2390 and1160
=4454 let5 /21 +719
-583 *492 <=286
Query 11
Status sat
Inferred Status None
Size 189754
Compressed Size14743
Max. Term Depth9
Asserts 1697
Declared Functions0
Declared Constants370
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1817 or2390 and1160
=4454 let5 /22 +719
-583 *492 <=288