Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.5/grid/grid_04x04_k3_k6_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
Size350251
Compressed Size21853
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 138447
Compressed Size11392
Max. Term Depth11
Asserts 1297
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1186 or1712 and1045 =3568
/276 +90 -72 *72
<=48
Query 2
Status sat
Inferred Status None
Size 153906
Compressed Size12245
Max. Term Depth11
Asserts 1343
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1370 or1939 and1048 =3749
/318 +363 -299 *253
<=140
Query 3
Status sat
Inferred Status None
Size 180216
Compressed Size13428
Max. Term Depth11
Asserts 1422
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1677 or2325 and1048 =4056
/393 +828 -677 *569
<=298
Query 4
Status sat
Inferred Status None
Size 200894
Compressed Size14667
Max. Term Depth11
Asserts 1485
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1916 or2626 and1049 =4294
/468 +1192 -978 *813
<=424
Query 5
Status sat
Inferred Status None
Size 217163
Compressed Size15529
Max. Term Depth11
Asserts 1536
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2102 or2863 and1049 =4480
/524 +1480 -1211 *1014
<=526
Query 6
Status sat
Inferred Status None
Size 239448
Compressed Size16504
Max. Term Depth11
Asserts 1602
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2363 or3189 and1050 =4740
/598 +1872 -1540 *1274
<=658
Query 7
Status sat
Inferred Status None
Size 274811
Compressed Size18106
Max. Term Depth11
Asserts 1713
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2769 or3706 and1050 =5146
/682 +2500 -2059 *1696
<=880
Query 8
Status sat
Inferred Status None
Size 300814
Compressed Size19342
Max. Term Depth11
Asserts 1794
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3067 or4082 and1053 =5441
/768 +2957 -2438 *2009
<=1042
Query 9
Status sat
Inferred Status None
Size 322956
Compressed Size20380
Max. Term Depth11
Asserts 1863
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3326 or4408 and1055 =5698
/826 +3352 -2757 *2283
<=1180
Query 10
Status sat
Inferred Status None
Size 326255
Compressed Size20554
Max. Term Depth11
Asserts 1873
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3366 or4456 and1057 =5736
/834 +3410 -2804 *2321
<=1200
Query 11
Status sat
Inferred Status None
Size 326403
Compressed Size20610
Max. Term Depth11
Asserts 1876
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3366 or4456 and1057 =5736
/837 +3410 -2804 *2321
<=1203
Query 12
Status sat
Inferred Status None
Size 342238
Compressed Size21199
Max. Term Depth11
Asserts 1926
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3549 or4689 and1057 =5919
/885 +3693 -3032 *2505
<=1303
Query 13
Status sat
Inferred Status None
Size 349081
Compressed Size21605
Max. Term Depth11
Asserts 1946
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3629 or4789 and1057 =5999
/910 +3813 -3135 *2585
<=1343
Query 14
Status sat
Inferred Status None
Size 350227
Compressed Size21705
Max. Term Depth11
Asserts 1950
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3642 or4805 and1058 =6011
/912 +3833 -3151 *2597
<=1351