Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/corridor/corridor_000_k2_H1.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
Size28973
Compressed Size3044
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 7836
Compressed Size1684
Max. Term Depth6
Asserts 66
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not35 or41 and19
=96 let1 +20 -16
*16 <=14
Query 2
Status sat
Inferred Status None
Size 8485
Compressed Size1789
Max. Term Depth8
Asserts 68
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not43 or50 and20
=103 let1 +31 -25
*23 <=18
Query 3
Status sat
Inferred Status None
Size 9184
Compressed Size1838
Max. Term Depth8
Asserts 70
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not51 or60 and20
=111 let1 /1 +43
-35 *31 <=22
Query 4
Status unsat
Inferred Status None
Size 9781
Compressed Size1900
Max. Term Depth8
Asserts 72
Declared Functions0
Declared Constants60
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not58 or68 and21
=117 let1 /1 +53
-43 *38 <=26
Query 5
Status sat
Inferred Status None
Size 13723
Compressed Size2229
Max. Term Depth8
Asserts 115
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not93 or109 and46
=211 let1 /1 +61
-49 *44 <=30
Query 6
Status sat
Inferred Status None
Size 14330
Compressed Size2281
Max. Term Depth8
Asserts 117
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not101 or117 and48
=217 let1 /1 +71
-57 *50 <=34
Query 7
Status sat
Inferred Status None
Size 15919
Compressed Size2385
Max. Term Depth8
Asserts 122
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not120 or140 and49
=235 let1 /3 +99
-80 *68 <=44
Query 8
Status sat
Inferred Status None
Size 16618
Compressed Size2443
Max. Term Depth8
Asserts 124
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not128 or150 and49
=243 let1 /4 +111
-90 *76 <=48
Query 9
Status sat
Inferred Status None
Size 18195
Compressed Size2530
Max. Term Depth8
Asserts 129
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not146 or173 and49
=261 let1 /6 +139
-113 *95 <=58
Query 10
Status sat
Inferred Status None
Size 20138
Compressed Size2629
Max. Term Depth8
Asserts 135
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not169 or202 and49
=284 let1 /6 +174
-142 *118 <=70
Query 11
Status sat
Inferred Status None
Size 20263
Compressed Size2663
Max. Term Depth8
Asserts 138
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not169 or202 and49
=284 let1 /8 +174
-142 *118 <=73
Query 12
Status unsat
Inferred Status None
Size 20367
Compressed Size2682
Max. Term Depth8
Asserts 140
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not169 or202 and49
=284 let1 /10 +174
-142 *118 <=75
Query 13
Status unsat
Inferred Status None
Size 26608
Compressed Size2879
Max. Term Depth8
Asserts 160
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not245 or295 and52
=357 let1 /15 +287
-235 *192 <=115
Query 14
Status sat
Inferred Status None
Size 26573
Compressed Size2863
Max. Term Depth8
Asserts 159
Declared Functions0
Declared Constants79
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not245 or295 and52
=357 let1 /14 +287
-235 *192 <=114