Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_02x02_k3_C.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
Size66264
Compressed Size5229
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 7727
Compressed Size1643
Max. Term Depth6
Asserts 66
Declared Functions0
Declared Constants61
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not33 or41 and15
=88 let2 /3 +18
-15 *15 <=15
Query 2
Status sat
Inferred Status None
Size 12432
Compressed Size1950
Max. Term Depth8
Asserts 80
Declared Functions0
Declared Constants61
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not89 or110 and16
=143 let2 /18 +101
-84 *70 <=43
Query 3
Status unsat
Inferred Status None
Size 13873
Compressed Size2085
Max. Term Depth8
Asserts 85
Declared Functions0
Declared Constants61
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not106 or130 and18
=158 let2 /21 +126
-105 *85 <=53
Query 4
Status sat
Inferred Status None
Size 22733
Compressed Size2868
Max. Term Depth8
Asserts 175
Declared Functions0
Declared Constants89
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not184 or235 and81
=386 let2 /33 +138
-114 *94 <=59
Query 5
Status sat
Inferred Status None
Size 35286
Compressed Size3589
Max. Term Depth8
Asserts 214
Declared Functions0
Declared Constants89
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not330 or420 and81
=532 let2 /62 +362
-300 *249 <=137
Query 6
Status sat
Inferred Status None
Size 46029
Compressed Size4384
Max. Term Depth8
Asserts 247
Declared Functions0
Declared Constants89
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not457 or578 and83
=657 let2 /94 +553
-458 *376 <=203
Query 7
Status sat
Inferred Status None
Size 52358
Compressed Size4751
Max. Term Depth8
Asserts 267
Declared Functions0
Declared Constants89
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not530 or671 and83
=730 let2 /109 +666
-551 *452 <=243
Query 8
Status sat
Inferred Status None
Size 53235
Compressed Size4830
Max. Term Depth8
Asserts 270
Declared Functions0
Declared Constants89
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not540 or683 and84
=739 let2 /110 +681
-563 *463 <=249
Query 9
Status sat
Inferred Status None
Size 58766
Compressed Size5134
Max. Term Depth8
Asserts 287
Declared Functions0
Declared Constants89
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not606 or764 and86
=803 let2 /123 +779
-644 *529 <=283
Query 10
Status sat
Inferred Status None
Size 59643
Compressed Size5198
Max. Term Depth8
Asserts 290
Declared Functions0
Declared Constants89
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not616 or776 and87
=812 let2 /124 +794
-656 *540 <=289
Query 11
Status sat
Inferred Status None
Size 59742
Compressed Size5228
Max. Term Depth8
Asserts 292
Declared Functions0
Declared Constants89
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite3 not616 or776 and87
=812 let2 /126 +794
-656 *540 <=291