Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_2/grid/grid_02x02_k2_k4_unsat_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
Size130143
Compressed Size8110
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 11133
Compressed Size1871
Max. Term Depth8
Asserts 87
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not68 or83 and12 =125
/4 +76 -64 *56
<=32
Query 3
Status sat
Inferred Status None
Size 12276
Compressed Size1989
Max. Term Depth8
Asserts 91
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not82 or99 and14 =137
/4 +96 -80 *68
<=40
Query 4
Status unsat
Inferred Status None
Size 13427
Compressed Size2130
Max. Term Depth8
Asserts 95
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not96 or115 and16 =149
/4 +116 -96 *81
<=48
Query 5
Status unsat
Inferred Status None
Size 20574
Compressed Size2652
Max. Term Depth8
Asserts 171
Declared Functions0
Declared Constants105
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not156 or191 and60 =321
/4 +132 -108 *93
<=56
Query 6
Status sat
Inferred Status None
Size 29268
Compressed Size3167
Max. Term Depth8
Asserts 263
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not232 or287 and116 =537
/4 +148 -120 *105
<=64
Query 7
Status sat
Inferred Status None
Size 37927
Compressed Size3716
Max. Term Depth8
Asserts 289
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not336 or417 and116 =641
/16 +304 -250 *209
<=116
Query 8
Status sat
Inferred Status None
Size 45730
Compressed Size4215
Max. Term Depth8
Asserts 314
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not429 or534 and117 =733
/19 +446 -367 *302
<=166
Query 9
Status unsat
Inferred Status None
Size 54389
Compressed Size4798
Max. Term Depth8
Asserts 343
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not531 or663 and119 =833
/21 +604 -496 *405
<=224
Query 10
Status unsat
Inferred Status None
Size 62980
Compressed Size5324
Max. Term Depth8
Asserts 435
Declared Functions0
Declared Constants171
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not607 or759 and175 =1049
/21 +620 -508 *417
<=232
Query 11
Status unsat
Inferred Status None
Size 71676
Compressed Size5889
Max. Term Depth8
Asserts 527
Declared Functions0
Declared Constants204
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not683 or855 and231 =1265
/21 +636 -520 *429
<=240
Query 12
Status unsat
Inferred Status None
Size 80372
Compressed Size6318
Max. Term Depth8
Asserts 619
Declared Functions0
Declared Constants237
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not759 or951 and287 =1481
/21 +652 -532 *441
<=248
Query 13
Status unsat
Inferred Status None
Size 89068
Compressed Size6736
Max. Term Depth8
Asserts 711
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not835 or1047 and343 =1697
/21 +668 -544 *453
<=256
Query 14
Status unsat
Inferred Status None
Size 97764
Compressed Size7148
Max. Term Depth8
Asserts 803
Declared Functions0
Declared Constants303
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not911 or1143 and399 =1913
/21 +684 -556 *465
<=264