Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.5/grid/grid_04x04_k5_k2_B.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
Size78697
Compressed Size6329
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 9273
Compressed Size1786
Max. Term Depth11
Asserts 65
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not42 or59 and30
=123 let1 /14 +12
-10 *10 <=10
Query 2
Status sat
Inferred Status None
Size 13108
Compressed Size2043
Max. Term Depth11
Asserts 76
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not86 or114 and30
=167 let1 /36 +78
-65 *54 <=32
Query 3
Status sat
Inferred Status None
Size 13454
Compressed Size2122
Max. Term Depth11
Asserts 77
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not90 or118 and31
=170 let1 /38 +83
-70 *57 <=34
Query 4
Status unsat
Inferred Status None
Size 13802
Compressed Size2143
Max. Term Depth11
Asserts 78
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not94 or122 and32
=173 let1 /40 +88
-75 *60 <=36
Query 5
Status sat
Inferred Status None
Size 54028
Compressed Size5136
Max. Term Depth14
Asserts 444
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not452 or684 and368
=1321 let1 /198 +96
-81 *66 <=40
Query 6
Status sat
Inferred Status None
Size 54372
Compressed Size5172
Max. Term Depth14
Asserts 445
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not456 or688 and369
=1324 let1 /200 +101
-86 *69 <=42
Query 7
Status sat
Inferred Status None
Size 54716
Compressed Size5187
Max. Term Depth14
Asserts 446
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not460 or692 and370
=1327 let1 /202 +106
-91 *72 <=44
Query 8
Status sat
Inferred Status None
Size 55060
Compressed Size5204
Max. Term Depth14
Asserts 447
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not464 or696 and371
=1330 let1 /204 +111
-96 *75 <=46
Query 9
Status sat
Inferred Status None
Size 55404
Compressed Size5210
Max. Term Depth14
Asserts 448
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not468 or700 and372
=1333 let1 /206 +116
-101 *78 <=48
Query 10
Status sat
Inferred Status None
Size 62591
Compressed Size5578
Max. Term Depth14
Asserts 470
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not550 or803 and373
=1414 let1 /239 +241
-201 *165 <=92
Query 11
Status sat
Inferred Status None
Size 64592
Compressed Size5673
Max. Term Depth14
Asserts 477
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not572 or831 and374
=1435 let1 /246 +276
-229 *186 <=106
Query 12
Status sat
Inferred Status None
Size 65497
Compressed Size5753
Max. Term Depth14
Asserts 480
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not582 or843 and375
=1444 let1 /250 +291
-243 *195 <=112
Query 13
Status sat
Inferred Status None
Size 73742
Compressed Size6220
Max. Term Depth14
Asserts 504
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not676 or961 and375
=1538 let1 /298 +433
-373 *289 <=160
Query 14
Status sat
Inferred Status None
Size 73883
Compressed Size6264
Max. Term Depth14
Asserts 507
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite2 not676 or961 and375
=1538 let1 /301 +433
-373 *289 <=163