Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.5/corridor/corridor_000_k2_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
Size38254
Compressed Size3341
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 7774
Compressed Size1653
Max. Term Depth5
Asserts 67
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not36 or41 and18 =93
+22 -18 *18 <=12
Query 2
Status sat
Inferred Status None
Size 9777
Compressed Size1774
Max. Term Depth8
Asserts 73
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not60 or71 and18 =117
+58 -48 *42 <=24
Query 3
Status sat
Inferred Status None
Size 10476
Compressed Size1838
Max. Term Depth8
Asserts 75
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not68 or81 and18 =125
/1 +70 -58 *50
<=28
Query 4
Status sat
Inferred Status None
Size 11071
Compressed Size1902
Max. Term Depth8
Asserts 77
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not75 or89 and19 =131
/1 +80 -66 *57
<=32
Query 5
Status sat
Inferred Status None
Size 12178
Compressed Size1962
Max. Term Depth8
Asserts 81
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not87 or105 and19 =143
/1 +100 -82 *69
<=40
Query 6
Status sat
Inferred Status None
Size 12877
Compressed Size2008
Max. Term Depth8
Asserts 83
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not95 or115 and19 =151
/2 +112 -92 *77
<=44
Query 7
Status sat
Inferred Status None
Size 13472
Compressed Size2077
Max. Term Depth8
Asserts 85
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not102 or123 and20 =157
/2 +122 -100 *84
<=48
Query 8
Status unsat
Inferred Status None
Size 14599
Compressed Size2125
Max. Term Depth8
Asserts 89
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not114 or139 and20 =169
/2 +142 -116 *99
<=56
Query 9
Status unsat
Inferred Status None
Size 18490
Compressed Size2484
Max. Term Depth8
Asserts 133
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not150 or181 and46 =265
/2 +150 -122 *105
<=60
Query 10
Status sat
Inferred Status None
Size 22624
Compressed Size2825
Max. Term Depth8
Asserts 177
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not186 or223 and72 =361
/2 +158 -128 *111
<=64
Query 11
Status sat
Inferred Status None
Size 25627
Compressed Size2938
Max. Term Depth8
Asserts 186
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not222 or268 and72 =397
/4 +212 -173 *147
<=82
Query 12
Status sat
Inferred Status None
Size 26758
Compressed Size2987
Max. Term Depth8
Asserts 190
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not234 or284 and72 =409
/4 +232 -189 *163
<=90
Query 13
Status unsat
Inferred Status None
Size 26886
Compressed Size3031
Max. Term Depth8
Asserts 193
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not234 or284 and72 =409
/6 +232 -189 *163
<=93
Query 14
Status sat
Inferred Status None
Size 30915
Compressed Size3143
Max. Term Depth8
Asserts 205
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not282 or345 and72 =457
/7 +306 -250 *215
<=118