Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_02x02_k2_k4_unsat_D.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
Size137595
Compressed Size9208
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 14910
Compressed Size2018
Max. Term Depth7
Asserts 147
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not88 or107 and48 =237
+44 -36 *36 <=24
Query 2
Status sat
Inferred Status None
Size 20913
Compressed Size2429
Max. Term Depth8
Asserts 165
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not160 or197 and48 =309
/8 +152 -126 *108
<=60
Query 3
Status sat
Inferred Status None
Size 26916
Compressed Size2742
Max. Term Depth8
Asserts 183
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not232 or287 and48 =381
/16 +260 -216 *180
<=96
Query 4
Status sat
Inferred Status None
Size 32813
Compressed Size3184
Max. Term Depth8
Asserts 203
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not302 or374 and51 =448
/18 +367 -303 *249
<=136
Query 5
Status sat
Inferred Status None
Size 37346
Compressed Size3502
Max. Term Depth8
Asserts 218
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not355 or441 and52 =500
/20 +449 -370 *305
<=166
Query 6
Status sat
Inferred Status None
Size 43697
Compressed Size3866
Max. Term Depth8
Asserts 239
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not431 or535 and55 =573
/22 +564 -464 *381
<=208
Query 7
Status sat
Inferred Status None
Size 46442
Compressed Size4041
Max. Term Depth8
Asserts 248
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not463 or575 and56 =604
/25 +613 -504 *414
<=226
Query 8
Status unsat
Inferred Status None
Size 49311
Compressed Size4229
Max. Term Depth8
Asserts 258
Declared Functions0
Declared Constants104
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not496 or617 and57 =636
/26 +665 -546 *447
<=246
Query 9
Status unsat
Inferred Status None
Size 57762
Compressed Size4917
Max. Term Depth8
Asserts 350
Declared Functions0
Declared Constants137
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not572 or713 and113 =852
/26 +681 -558 *459
<=254
Query 10
Status unsat
Inferred Status None
Size 66458
Compressed Size5531
Max. Term Depth8
Asserts 442
Declared Functions0
Declared Constants170
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not648 or809 and169 =1068
/26 +697 -570 *471
<=262
Query 11
Status unsat
Inferred Status None
Size 75154
Compressed Size5975
Max. Term Depth8
Asserts 534
Declared Functions0
Declared Constants203
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not724 or905 and225 =1284
/26 +713 -582 *483
<=270
Query 12
Status unsat
Inferred Status None
Size 83850
Compressed Size6387
Max. Term Depth8
Asserts 626
Declared Functions0
Declared Constants236
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not800 or1001 and281 =1500
/26 +729 -594 *495
<=278
Query 13
Status unsat
Inferred Status None
Size 92546
Compressed Size6791
Max. Term Depth8
Asserts 718
Declared Functions0
Declared Constants269
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not876 or1097 and337 =1716
/26 +745 -606 *507
<=286
Query 14
Status unsat
Inferred Status None
Size 101242
Compressed Size7197
Max. Term Depth8
Asserts 810
Declared Functions0
Declared Constants302
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not952 or1193 and393 =1932
/26 +761 -618 *519
<=294