Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/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
Size156706
Compressed Size12762
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 calls12
Query 1
Status sat
Inferred Status None
Size 124392
Compressed Size10496
Max. Term Depth8
Asserts 1261
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1128 or1497 and905 =3200
+115 -90 *90 <=60
Query 2
Status sat
Inferred Status None
Size 130121
Compressed Size11086
Max. Term Depth8
Asserts 1278
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1196 or1582 and905 =3268
/11 +217 -175 *158
<=94
Query 3
Status sat
Inferred Status None
Size 136975
Compressed Size11577
Max. Term Depth8
Asserts 1300
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1278 or1684 and907 =3348
/11 +341 -277 *238
<=138
Query 4
Status sat
Inferred Status None
Size 141595
Compressed Size11936
Max. Term Depth8
Asserts 1315
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1332 or1752 and908 =3401
/13 +424 -345 *294
<=168
Query 5
Status sat
Inferred Status None
Size 146625
Compressed Size12224
Max. Term Depth8
Asserts 1330
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1392 or1827 and908 =3461
/17 +514 -420 *354
<=198
Query 6
Status sat
Inferred Status None
Size 148342
Compressed Size12311
Max. Term Depth8
Asserts 1335
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1412 or1852 and908 =3481
/21 +544 -445 *374
<=208
Query 7
Status sat
Inferred Status None
Size 149726
Compressed Size12385
Max. Term Depth8
Asserts 1340
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1427 or1872 and908 =3496
/21 +569 -465 *390
<=218
Query 8
Status sat
Inferred Status None
Size 152396
Compressed Size12534
Max. Term Depth8
Asserts 1348
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1459 or1912 and908 =3528
/21 +617 -505 *422
<=234
Query 9
Status sat
Inferred Status None
Size 153797
Compressed Size12599
Max. Term Depth8
Asserts 1353
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1474 or1932 and908 =3543
/21 +642 -525 *441
<=244
Query 10
Status sat
Inferred Status None
Size 155184
Compressed Size12666
Max. Term Depth8
Asserts 1358
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1489 or1952 and908 =3558
/21 +667 -545 *456
<=254
Query 11
Status sat
Inferred Status None
Size 156596
Compressed Size12743
Max. Term Depth8
Asserts 1363
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1504 or1972 and908 =3573
/21 +692 -565 *475
<=264
Query 12
Status sat
Inferred Status None
Size 156690
Compressed Size12776
Max. Term Depth8
Asserts 1365
Declared Functions0
Declared Constants309
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1504 or1972 and908 =3573
/22 +692 -565 *475
<=266