Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k5_k4_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
Size288442
Compressed Size17312
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 16695
Compressed Size2325
Max. Term Depth11
Asserts 127
Declared Functions0
Declared Constants152
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not84 or119 and60 =245
/28 +28 -24 *24
<=16
Query 2
Status sat
Inferred Status None
Size 38194
Compressed Size3581
Max. Term Depth11
Asserts 189
Declared Functions0
Declared Constants152
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not332 or429 and60 =493
/152 +400 -334 *272
<=140
Query 3
Status sat
Inferred Status None
Size 39442
Compressed Size3732
Max. Term Depth11
Asserts 193
Declared Functions0
Declared Constants152
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not348 or445 and64 =505
/158 +420 -352 *284
<=148
Query 4
Status unsat
Inferred Status None
Size 40690
Compressed Size3807
Max. Term Depth11
Asserts 197
Declared Functions0
Declared Constants152
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not364 or461 and68 =517
/164 +440 -370 *296
<=156
Query 5
Status sat
Inferred Status None
Size 121222
Compressed Size9528
Max. Term Depth14
Asserts 929
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1080 or1585 and740 =2813
/480 +456 -382 *308
<=164
Query 6
Status sat
Inferred Status None
Size 135705
Compressed Size10363
Max. Term Depth14
Asserts 972
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1247 or1791 and744 =2976
/561 +705 -604 *471
<=250
Query 7
Status sat
Inferred Status None
Size 148577
Compressed Size11221
Max. Term Depth14
Asserts 1011
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1394 or1973 and748 =3119
/629 +926 -806 *620
<=328
Query 8
Status sat
Inferred Status None
Size 173971
Compressed Size12456
Max. Term Depth14
Asserts 1086
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1686 or2338 and750 =3409
/764 +1366 -1189 *916
<=478
Query 9
Status sat
Inferred Status None
Size 187128
Compressed Size13087
Max. Term Depth14
Asserts 1127
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1836 or2526 and753 =3556
/833 +1595 -1373 *1066
<=560
Query 10
Status sat
Inferred Status None
Size 209068
Compressed Size14213
Max. Term Depth14
Asserts 1194
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2084 or2838 and756 =3801
/943 +1974 -1712 *1323
<=694
Query 11
Status sat
Inferred Status None
Size 230564
Compressed Size15265
Max. Term Depth14
Asserts 1260
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2328 or3146 and758 =4043
/1052 +2348 -2022 *1580
<=826
Query 12
Status sat
Inferred Status None
Size 252964
Compressed Size16527
Max. Term Depth14
Asserts 1327
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2582 or3467 and758 =4297
/1175 +2736 -2341 *1845
<=960
Query 13
Status sat
Inferred Status None
Size 263998
Compressed Size17155
Max. Term Depth14
Asserts 1359
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2710 or3626 and759 =4424
/1231 +2927 -2504 *1972
<=1024
Query 14
Status sat
Inferred Status None
Size 264108
Compressed Size17198
Max. Term Depth14
Asserts 1361
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2710 or3626 and759 =4424
/1233 +2927 -2504 *1972
<=1026