Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k2_k5_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
Size165460
Compressed Size13136
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 calls10
Query 1
Status sat
Inferred Status None
Size 124587
Compressed Size10548
Max. Term Depth8
Asserts 1261
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1128 or1497 and905
=3200 let4 +110 -85
*85 <=65
Query 2
Status sat
Inferred Status None
Size 132787
Compressed Size11249
Max. Term Depth8
Asserts 1286
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1227 or1619 and907
=3297 let4 /8 +257
-205 *183 <=115
Query 3
Status sat
Inferred Status None
Size 137795
Compressed Size11585
Max. Term Depth8
Asserts 1303
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1285 or1693 and908
=3354 let4 /8 +348
-279 *240 <=149
Query 4
Status sat
Inferred Status None
Size 147406
Compressed Size12175
Max. Term Depth8
Asserts 1332
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1400 or1837 and908
=3469 let4 /16 +521
-423 *355 <=207
Query 5
Status sat
Inferred Status None
Size 153681
Compressed Size12443
Max. Term Depth8
Asserts 1352
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1474 or1931 and908
=3543 let4 /16 +635
-517 *430 <=247
Query 6
Status sat
Inferred Status None
Size 155143
Compressed Size12519
Max. Term Depth8
Asserts 1357
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1490 or1952 and908
=3559 let4 /16 +661
-538 *450 <=257
Query 7
Status sat
Inferred Status None
Size 156530
Compressed Size12600
Max. Term Depth8
Asserts 1362
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1505 or1972 and908
=3574 let4 /16 +686
-558 *465 <=267
Query 8
Status sat
Inferred Status None
Size 163904
Compressed Size12988
Max. Term Depth8
Asserts 1385
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1592 or2082 and908
=3661 let4 /22 +819
-668 *552 <=313
Query 9
Status sat
Inferred Status None
Size 165352
Compressed Size13061
Max. Term Depth8
Asserts 1390
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1608 or2103 and908
=3677 let4 /22 +845
-689 *568 <=323
Query 10
Status sat
Inferred Status None
Size 165444
Compressed Size13111
Max. Term Depth8
Asserts 1392
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite5 not1608 or2103 and908
=3677 let4 /23 +845
-689 *568 <=325