Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_04x04_k2_k4_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
Size102283
Compressed Size8583
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 calls13
Query 1
Status sat
Inferred Status None
Size 71240
Compressed Size6661
Max. Term Depth7
Asserts 707
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not616 or825 and497 =1777
+76 -60 *60 <=40
Query 2
Status sat
Inferred Status None
Size 73881
Compressed Size6931
Max. Term Depth8
Asserts 715
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not648 or864 and498 =1808
+123 -99 *91 <=56
Query 3
Status sat
Inferred Status None
Size 77589
Compressed Size7166
Max. Term Depth8
Asserts 726
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not692 or919 and498 =1852
/4 +189 -154 *135
<=78
Query 4
Status sat
Inferred Status None
Size 81226
Compressed Size7384
Max. Term Depth8
Asserts 737
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not735 or973 and498 =1895
/6 +254 -208 *179
<=100
Query 5
Status sat
Inferred Status None
Size 84397
Compressed Size7551
Max. Term Depth8
Asserts 747
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not773 or1020 and499 =1932
/6 +311 -255 *217
<=120
Query 6
Status sat
Inferred Status None
Size 87517
Compressed Size7738
Max. Term Depth8
Asserts 757
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not809 or1066 and499 =1968
/10 +367 -301 *253
<=140
Query 7
Status sat
Inferred Status None
Size 89928
Compressed Size7892
Max. Term Depth8
Asserts 765
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not836 or1101 and499 =1995
/12 +410 -336 *284
<=156
Query 8
Status sat
Inferred Status None
Size 92746
Compressed Size8021
Max. Term Depth8
Asserts 774
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not868 or1142 and499 =2027
/16 +460 -377 *319
<=174
Query 9
Status sat
Inferred Status None
Size 94716
Compressed Size8125
Max. Term Depth8
Asserts 780
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not891 or1171 and499 =2050
/16 +495 -406 *343
<=186
Query 10
Status sat
Inferred Status None
Size 97176
Compressed Size8289
Max. Term Depth8
Asserts 788
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not919 or1207 and499 =2078
/18 +539 -442 *371
<=202
Query 11
Status sat
Inferred Status None
Size 98212
Compressed Size8364
Max. Term Depth8
Asserts 791
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not931 or1222 and499 =2090
/20 +557 -457 *383
<=208
Query 12
Status sat
Inferred Status None
Size 102174
Compressed Size8564
Max. Term Depth8
Asserts 803
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not978 or1281 and499 =2137
/22 +628 -515 *431
<=232
Query 13
Status sat
Inferred Status None
Size 102267
Compressed Size8590
Max. Term Depth8
Asserts 805
Declared Functions0
Declared Constants208
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not978 or1281 and499 =2137
/23 +628 -515 *431
<=234