Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/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
Size70345
Compressed Size5787
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 9219
Compressed Size1752
Max. Term Depth11
Asserts 65
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

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

Symbols

not86 or114 and30 =167
/36 +80 -67 *56
<=30
Query 3
Status sat
Inferred Status None
Size 13400
Compressed Size2095
Max. Term Depth11
Asserts 77
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not90 or118 and31 =170
/38 +85 -72 *59
<=32
Query 4
Status unsat
Inferred Status None
Size 13748
Compressed Size2114
Max. Term Depth11
Asserts 78
Declared Functions0
Declared Constants78
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not94 or122 and32 =173
/40 +90 -77 *62
<=34
Query 5
Status sat
Inferred Status None
Size 53971
Compressed Size5111
Max. Term Depth14
Asserts 444
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not452 or684 and368 =1321
/198 +98 -83 *68
<=38
Query 6
Status sat
Inferred Status None
Size 54315
Compressed Size5147
Max. Term Depth14
Asserts 445
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not456 or688 and369 =1324
/200 +103 -88 *71
<=40
Query 7
Status sat
Inferred Status None
Size 54659
Compressed Size5161
Max. Term Depth14
Asserts 446
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not460 or692 and370 =1327
/202 +108 -93 *74
<=42
Query 8
Status sat
Inferred Status None
Size 55003
Compressed Size5180
Max. Term Depth14
Asserts 447
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not464 or696 and371 =1330
/204 +113 -98 *77
<=44
Query 9
Status sat
Inferred Status None
Size 55347
Compressed Size5186
Max. Term Depth14
Asserts 448
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not468 or700 and372 =1333
/206 +118 -103 *80
<=46
Query 10
Status sat
Inferred Status None
Size 62534
Compressed Size5552
Max. Term Depth14
Asserts 470
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not550 or803 and373 =1414
/239 +243 -203 *167
<=90
Query 11
Status sat
Inferred Status None
Size 64535
Compressed Size5647
Max. Term Depth14
Asserts 477
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not572 or831 and374 =1435
/246 +278 -231 *188
<=104
Query 12
Status sat
Inferred Status None
Size 65440
Compressed Size5725
Max. Term Depth14
Asserts 480
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not582 or843 and375 =1444
/250 +293 -245 *197
<=110
Query 13
Status sat
Inferred Status None
Size 65585
Compressed Size5768
Max. Term Depth14
Asserts 483
Declared Functions0
Declared Constants115
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not582 or843 and375 =1444
/253 +293 -245 *197
<=113