Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/corridor/corridor_000_k2_I1.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
Size43677
Compressed Size3655
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 calls15
Query 1
Status sat
Inferred Status None
Size 7828
Compressed Size1680
Max. Term Depth5
Asserts 67
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not36 or41 and18
=93 let1 +20 -16
*16 <=14
Query 2
Status sat
Inferred Status None
Size 10653
Compressed Size1875
Max. Term Depth8
Asserts 76
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not69 or83 and18
=126 let1 +71 -58
*52 <=32
Query 3
Status sat
Inferred Status None
Size 11688
Compressed Size1926
Max. Term Depth8
Asserts 79
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not81 or98 and18
=138 let1 /2 +89
-73 *64 <=38
Query 4
Status sat
Inferred Status None
Size 12283
Compressed Size1983
Max. Term Depth8
Asserts 81
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not88 or106 and19
=144 let1 /2 +99
-81 *71 <=42
Query 5
Status sat
Inferred Status None
Size 13390
Compressed Size2042
Max. Term Depth8
Asserts 85
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not100 or122 and19
=156 let1 /2 +119
-97 *83 <=50
Query 6
Status sat
Inferred Status None
Size 14089
Compressed Size2124
Max. Term Depth8
Asserts 87
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not108 or132 and19
=164 let1 /3 +131
-107 *91 <=54
Query 7
Status unsat
Inferred Status None
Size 14686
Compressed Size2174
Max. Term Depth8
Asserts 89
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not115 or140 and20
=170 let1 /3 +141
-115 *98 <=58
Query 8
Status unsat
Inferred Status None
Size 18612
Compressed Size2480
Max. Term Depth8
Asserts 133
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not151 or182 and46
=266 let1 /3 +149
-121 *104 <=62
Query 9
Status sat
Inferred Status None
Size 22749
Compressed Size2845
Max. Term Depth8
Asserts 177
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not187 or224 and72
=362 let1 /3 +157
-127 *110 <=66
Query 10
Status sat
Inferred Status None
Size 25740
Compressed Size2992
Max. Term Depth8
Asserts 186
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not223 or269 and72
=398 let1 /4 +211
-171 *146 <=84
Query 11
Status sat
Inferred Status None
Size 26853
Compressed Size3058
Max. Term Depth8
Asserts 190
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not235 or285 and72
=410 let1 /4 +231
-187 *159 <=92
Query 12
Status sat
Inferred Status None
Size 26970
Compressed Size3085
Max. Term Depth8
Asserts 193
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not235 or285 and72
=410 let1 /5 +231
-187 *159 <=95
Query 13
Status sat
Inferred Status None
Size 27669
Compressed Size3147
Max. Term Depth8
Asserts 195
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not243 or295 and72
=418 let1 /6 +243
-197 *167 <=99
Query 14
Status unsat
Inferred Status None
Size 29620
Compressed Size3267
Max. Term Depth8
Asserts 201
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not266 or324 and72
=441 let1 /6 +278
-226 *191 <=111
Query 15
Status sat
Inferred Status None
Size 33558
Compressed Size3384
Max. Term Depth8
Asserts 213
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not314 or385 and72
=489 let1 /7 +352
-286 *240 <=136