Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/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
Size37811
Compressed Size3430
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 7828
Compressed Size1682
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 Size1877
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 11352
Compressed Size1925
Max. Term Depth8
Asserts 78
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not77 or93 and18
=134 let1 /1 +83
-68 *60 <=36
Query 4
Status sat
Inferred Status None
Size 11947
Compressed Size1985
Max. Term Depth8
Asserts 80
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not84 or101 and19
=140 let1 /1 +93
-76 *67 <=40
Query 5
Status sat
Inferred Status None
Size 13054
Compressed Size2041
Max. Term Depth8
Asserts 84
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not96 or117 and19
=152 let1 /1 +113
-92 *79 <=48
Query 6
Status sat
Inferred Status None
Size 13753
Compressed Size2121
Max. Term Depth8
Asserts 86
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not104 or127 and19
=160 let1 /2 +125
-102 *87 <=52
Query 7
Status unsat
Inferred Status None
Size 14350
Compressed Size2173
Max. Term Depth8
Asserts 88
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not111 or135 and20
=166 let1 /2 +135
-110 *94 <=56
Query 8
Status unsat
Inferred Status None
Size 18276
Compressed Size2517
Max. Term Depth8
Asserts 132
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not147 or177 and46
=262 let1 /2 +143
-116 *100 <=60
Query 9
Status sat
Inferred Status None
Size 22413
Compressed Size2864
Max. Term Depth8
Asserts 176
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not183 or219 and72
=358 let1 /2 +151
-122 *106 <=64
Query 10
Status sat
Inferred Status None
Size 25416
Compressed Size2984
Max. Term Depth8
Asserts 185
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not219 or264 and72
=394 let1 /4 +205
-167 *142 <=82
Query 11
Status sat
Inferred Status None
Size 26529
Compressed Size3069
Max. Term Depth8
Asserts 189
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not231 or280 and72
=406 let1 /4 +225
-183 *155 <=90
Query 12
Status unsat
Inferred Status None
Size 26656
Compressed Size3103
Max. Term Depth8
Asserts 192
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not231 or280 and72
=406 let1 /6 +225
-183 *155 <=93
Query 13
Status sat
Inferred Status None
Size 30668
Compressed Size3203
Max. Term Depth8
Asserts 204
Declared Functions0
Declared Constants98
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not279 or341 and72
=454 let1 /7 +299
-244 *204 <=118