Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/grid/grid_04x04_k4_k2_A.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
Size132191
Compressed Size7006
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 8994
Compressed Size1722
Max. Term Depth10
Asserts 63
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not40 or55 and28
=115 let1 /10 +12
-10 *10 <=10
Query 2
Status sat
Inferred Status None
Size 10755
Compressed Size1889
Max. Term Depth10
Asserts 68
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not60 or80 and28
=135 let1 /20 +42
-35 *30 <=20
Query 3
Status sat
Inferred Status None
Size 11098
Compressed Size1946
Max. Term Depth10
Asserts 69
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not64 or84 and29
=138 let1 /22 +47
-40 *33 <=22
Query 4
Status unsat
Inferred Status None
Size 11443
Compressed Size1976
Max. Term Depth10
Asserts 70
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not68 or88 and30
=141 let1 /24 +52
-45 *36 <=24
Query 5
Status sat
Inferred Status None
Size 42725
Compressed Size4371
Max. Term Depth15
Asserts 360
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not350 or516 and292
=1019 let1 /128 +60
-51 *42 <=28
Query 6
Status sat
Inferred Status None
Size 43632
Compressed Size4483
Max. Term Depth15
Asserts 363
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not360 or528 and293
=1028 let1 /133 +75
-65 *51 <=34
Query 7
Status sat
Inferred Status None
Size 43769
Compressed Size4521
Max. Term Depth15
Asserts 366
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not360 or528 and293
=1028 let1 /136 +75
-65 *51 <=37
Query 8
Status sat
Inferred Status None
Size 51553
Compressed Size4903
Max. Term Depth15
Asserts 390
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not450 or641 and294
=1117 let1 /161 +212
-177 *146 <=85
Query 9
Status sat
Inferred Status None
Size 51658
Compressed Size4918
Max. Term Depth15
Asserts 392
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not450 or641 and294
=1117 let1 /163 +212
-177 *146 <=87
Query 10
Status sat
Inferred Status None
Size 70534
Compressed Size5738
Max. Term Depth15
Asserts 450
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not667 or916 and294
=1334 let1 /231 +545
-461 *363 <=203
Query 11
Status sat
Inferred Status None
Size 79396
Compressed Size6190
Max. Term Depth15
Asserts 477
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not769 or1044 and295
=1435 let1 /272 +700
-586 *470 <=257
Query 12
Status sat
Inferred Status None
Size 82867
Compressed Size6359
Max. Term Depth15
Asserts 487
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not809 or1093 and296
=1474 let1 /291 +759
-640 *509 <=277
Query 13
Status unsat
Inferred Status None
Size 86293
Compressed Size6589
Max. Term Depth15
Asserts 497
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not849 or1142 and297
=1513 let1 /307 +818
-691 *548 <=297
Query 14
Status sat
Inferred Status None
Size 94739
Compressed Size6552
Max. Term Depth15
Asserts 523
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not949 or1267 and299
=1611 let1 /336 +970
-817 *652 <=350