Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/corridor/corridor_001_k2_D.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
Size42353
Compressed Size3963
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 calls16
Query 1
Status sat
Inferred Status None
Size 12637
Compressed Size2072
Max. Term Depth5
Asserts 115
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not76 or92 and53
=214 let1 +28 -22
*22 <=18
Query 2
Status sat
Inferred Status None
Size 13000
Compressed Size2129
Max. Term Depth8
Asserts 116
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not80 or97 and53
=218 let1 +34 -27
*26 <=20
Query 3
Status sat
Inferred Status None
Size 13607
Compressed Size2191
Max. Term Depth8
Asserts 118
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not88 or105 and55
=224 let1 +44 -35
*32 <=24
Query 4
Status sat
Inferred Status None
Size 14306
Compressed Size2247
Max. Term Depth8
Asserts 120
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not96 or115 and55
=232 let1 /1 +56
-45 *40 <=28
Query 5
Status sat
Inferred Status None
Size 17053
Compressed Size2425
Max. Term Depth8
Asserts 129
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not128 or156 and55
=264 let1 /1 +106
-86 *72 <=46
Query 6
Status sat
Inferred Status None
Size 18340
Compressed Size2510
Max. Term Depth8
Asserts 133
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not143 or175 and55
=279 let1 /1 +129
-105 *87 <=54
Query 7
Status unsat
Inferred Status None
Size 18919
Compressed Size2581
Max. Term Depth8
Asserts 135
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not149 or183 and55
=285 let1 /1 +139
-113 *94 <=58
Query 8
Status sat
Inferred Status None
Size 24308
Compressed Size2998
Max. Term Depth8
Asserts 195
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not201 or245 and94
=424 let1 /1 +147
-119 *100 <=62
Query 9
Status sat
Inferred Status None
Size 24915
Compressed Size3044
Max. Term Depth8
Asserts 197
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not209 or253 and96
=430 let1 /1 +157
-127 *106 <=66
Query 10
Status sat
Inferred Status None
Size 25772
Compressed Size3094
Max. Term Depth8
Asserts 200
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not218 or265 and96
=439 let1 /1 +172
-139 *118 <=72
Query 11
Status sat
Inferred Status None
Size 26471
Compressed Size3158
Max. Term Depth8
Asserts 202
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not226 or275 and96
=447 let1 /2 +184
-149 *126 <=76
Query 12
Status sat
Inferred Status None
Size 29296
Compressed Size3308
Max. Term Depth8
Asserts 211
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not259 or317 and96
=480 let1 /2 +235
-191 *162 <=94
Query 13
Status sat
Inferred Status None
Size 29995
Compressed Size3361
Max. Term Depth8
Asserts 213
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not267 or327 and96
=488 let1 /3 +247
-201 *170 <=98
Query 14
Status sat
Inferred Status None
Size 30121
Compressed Size3400
Max. Term Depth8
Asserts 216
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not267 or327 and96
=488 let1 /5 +247
-201 *170 <=101
Query 15
Status unsat
Inferred Status None
Size 30225
Compressed Size3417
Max. Term Depth8
Asserts 218
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not267 or327 and96
=488 let1 /7 +247
-201 *170 <=103
Query 16
Status sat
Inferred Status None
Size 35702
Compressed Size3688
Max. Term Depth8
Asserts 235
Declared Functions0
Declared Constants97
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not333 or409 and98
=552 let1 /8 +347
-283 *240 <=138