Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_02x02_k2_k4_unsat_C.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
Size127579
Compressed Size8070
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 8442
Compressed Size1654
Max. Term Depth7
Asserts 79
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not36 or43 and12 =93
+28 -24 *24 <=16
Query 2
Status sat
Inferred Status None
Size 10477
Compressed Size1822
Max. Term Depth8
Asserts 85
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not60 or73 and12 =117
/4 +64 -54 *48
<=28
Query 3
Status sat
Inferred Status None
Size 11620
Compressed Size1907
Max. Term Depth8
Asserts 89
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not74 or89 and14 =129
/4 +84 -70 *60
<=36
Query 4
Status unsat
Inferred Status None
Size 12777
Compressed Size2008
Max. Term Depth8
Asserts 93
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not88 or105 and16 =141
/4 +104 -86 *74
<=44
Query 5
Status unsat
Inferred Status None
Size 19924
Compressed Size2560
Max. Term Depth8
Asserts 169
Declared Functions0
Declared Constants105
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not148 or181 and60 =313
/4 +120 -98 *86
<=52
Query 6
Status sat
Inferred Status None
Size 28618
Compressed Size3084
Max. Term Depth8
Asserts 261
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not224 or277 and116 =529
/4 +136 -110 *98
<=60
Query 7
Status sat
Inferred Status None
Size 36621
Compressed Size3635
Max. Term Depth8
Asserts 285
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not320 or397 and116 =625
/16 +280 -230 *194
<=108
Query 8
Status sat
Inferred Status None
Size 45238
Compressed Size4165
Max. Term Depth8
Asserts 313
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not423 or526 and118 =726
/18 +437 -359 *296
<=164
Query 9
Status unsat
Inferred Status None
Size 53107
Compressed Size4656
Max. Term Depth8
Asserts 340
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not514 or643 and119 =816
/19 +581 -476 *391
<=218
Query 10
Status unsat
Inferred Status None
Size 61698
Compressed Size5260
Max. Term Depth8
Asserts 432
Declared Functions0
Declared Constants171
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not590 or739 and175 =1032
/19 +597 -488 *403
<=226
Query 11
Status unsat
Inferred Status None
Size 70394
Compressed Size5752
Max. Term Depth8
Asserts 524
Declared Functions0
Declared Constants204
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not666 or835 and231 =1248
/19 +613 -500 *415
<=234
Query 12
Status unsat
Inferred Status None
Size 79090
Compressed Size6177
Max. Term Depth8
Asserts 616
Declared Functions0
Declared Constants237
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not742 or931 and287 =1464
/19 +629 -512 *427
<=242
Query 13
Status unsat
Inferred Status None
Size 87786
Compressed Size6573
Max. Term Depth8
Asserts 708
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not818 or1027 and343 =1680
/19 +645 -524 *439
<=250
Query 14
Status unsat
Inferred Status None
Size 96482
Compressed Size6976
Max. Term Depth8
Asserts 800
Declared Functions0
Declared Constants303
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not894 or1123 and399 =1896
/19 +661 -536 *451
<=258