Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_02x02_k2_k4_unsat_A.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
Size136601
Compressed Size9135
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 calls14
Query 1
Status sat
Inferred Status None
Size 8582
Compressed Size1702
Max. Term Depth7
Asserts 79
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not36 or43 and12
=93 let3 +24 -20
*20 <=20
Query 2
Status sat
Inferred Status None
Size 11273
Compressed Size1924
Max. Term Depth8
Asserts 87
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not68 or83 and12
=125 let3 /4 +72
-60 *52 <=36
Query 3
Status sat
Inferred Status None
Size 12416
Compressed Size2042
Max. Term Depth8
Asserts 91
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not82 or99 and14
=137 let3 /4 +92
-76 *64 <=44
Query 4
Status unsat
Inferred Status None
Size 13567
Compressed Size2157
Max. Term Depth8
Asserts 95
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not96 or115 and16
=149 let3 /4 +112
-92 *77 <=52
Query 5
Status unsat
Inferred Status None
Size 20714
Compressed Size2697
Max. Term Depth8
Asserts 171
Declared Functions0
Declared Constants105
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not156 or191 and60
=321 let3 /4 +128
-104 *89 <=60
Query 6
Status sat
Inferred Status None
Size 29417
Compressed Size3213
Max. Term Depth8
Asserts 263
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not232 or287 and116
=537 let3 /4 +144
-116 *101 <=68
Query 7
Status sat
Inferred Status None
Size 39080
Compressed Size3836
Max. Term Depth8
Asserts 293
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not348 or431 and118
=651 let3 /15 +318
-260 *219 <=128
Query 8
Status sat
Inferred Status None
Size 48563
Compressed Size4444
Max. Term Depth8
Asserts 324
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not460 or573 and119
=762 let3 /19 +491
-402 *331 <=190
Query 9
Status unsat
Inferred Status None
Size 57180
Compressed Size4903
Max. Term Depth8
Asserts 352
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not563 or702 and121
=863 let3 /20 +648
-531 *434 <=246
Query 10
Status unsat
Inferred Status None
Size 65771
Compressed Size5442
Max. Term Depth8
Asserts 444
Declared Functions0
Declared Constants171
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not639 or798 and177
=1079 let3 /20 +664
-543 *446 <=254
Query 11
Status unsat
Inferred Status None
Size 74467
Compressed Size5994
Max. Term Depth8
Asserts 536
Declared Functions0
Declared Constants204
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not715 or894 and233
=1295 let3 /20 +680
-555 *458 <=262
Query 12
Status unsat
Inferred Status None
Size 83163
Compressed Size6435
Max. Term Depth8
Asserts 628
Declared Functions0
Declared Constants237
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not791 or990 and289
=1511 let3 /20 +696
-567 *470 <=270
Query 13
Status unsat
Inferred Status None
Size 91859
Compressed Size6845
Max. Term Depth8
Asserts 720
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not867 or1086 and345
=1727 let3 /20 +712
-579 *482 <=278
Query 14
Status unsat
Inferred Status None
Size 100555
Compressed Size7264
Max. Term Depth8
Asserts 812
Declared Functions0
Declared Constants303
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not943 or1182 and401
=1943 let3 /20 +728
-591 *494 <=286