Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k3_k6_A1.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
Size358723
Compressed Size21997
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 150893
Compressed Size12065
Max. Term Depth11
Asserts 1419
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1308 or1891 and1157 =3941
/306 +90 -72 *72
<=48
Query 2
Status sat
Inferred Status None
Size 174518
Compressed Size12949
Max. Term Depth11
Asserts 1489
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1588 or2241 and1157 =4221
/380 +510 -422 *352
<=188
Query 3
Status sat
Inferred Status None
Size 192775
Compressed Size13896
Max. Term Depth11
Asserts 1543
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not1804 or2509 and1159 =4435
/443 +832 -693 *566
<=296
Query 4
Status sat
Inferred Status None
Size 225611
Compressed Size15485
Max. Term Depth11
Asserts 1641
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2187 or2990 and1159 =4818
/574 +1411 -1172 *949
<=492
Query 5
Status sat
Inferred Status None
Size 248327
Compressed Size16651
Max. Term Depth11
Asserts 1710
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2453 or3324 and1160 =5083
/658 +1814 -1509 *1214
<=630
Query 6
Status sat
Inferred Status None
Size 261188
Compressed Size17220
Max. Term Depth11
Asserts 1750
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2603 or3513 and1161 =5232
/695 +2043 -1700 *1363
<=710
Query 7
Status sat
Inferred Status None
Size 279894
Compressed Size18173
Max. Term Depth11
Asserts 1808
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2820 or3786 and1163 =5447
/768 +2374 -1967 *1584
<=826
Query 8
Status sat
Inferred Status None
Size 309802
Compressed Size19678
Max. Term Depth11
Asserts 1899
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3170 or4226 and1164 =5796
/865 +2905 -2396 *1943
<=1008
Query 9
Status sat
Inferred Status None
Size 328216
Compressed Size20567
Max. Term Depth11
Asserts 1956
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3383 or4496 and1164 =6009
/917 +3232 -2662 *2168
<=1122
Query 10
Status sat
Inferred Status None
Size 336477
Compressed Size20943
Max. Term Depth11
Asserts 1981
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3479 or4616 and1165 =6104
/947 +3377 -2781 *2267
<=1172
Query 11
Status sat
Inferred Status None
Size 351656
Compressed Size21506
Max. Term Depth11
Asserts 2028
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3655 or4839 and1165 =6280
/987 +3647 -3004 *2451
<=1266
Query 12
Status sat
Inferred Status None
Size 355548
Compressed Size21730
Max. Term Depth11
Asserts 2040
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3700 or4896 and1165 =6325
/999 +3716 -3061 *2496
<=1290
Query 13
Status sat
Inferred Status None
Size 358598
Compressed Size21864
Max. Term Depth11
Asserts 2051
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3733 or4940 and1165 =6358
/1005 +3771 -3105 *2529
<=1312
Query 14
Status sat
Inferred Status None
Size 358707
Compressed Size21909
Max. Term Depth11
Asserts 2053
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3733 or4940 and1165 =6358
/1007 +3771 -3105 *2529
<=1314