Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/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
Size137381
Compressed Size8654
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 8582
Compressed Size1702
Max. Term Depth7
Asserts 79
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not36 or43 and12
=93 let3 +24 -20
*20 <=20
Query 2
Status sat
Inferred Status None
Size 10617
Compressed Size1875
Max. Term Depth8
Asserts 85
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not60 or73 and12
=117 let3 /4 +60
-50 *44 <=32
Query 3
Status sat
Inferred Status None
Size 11760
Compressed Size1959
Max. Term Depth8
Asserts 89
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not74 or89 and14
=129 let3 /4 +80
-66 *56 <=40
Query 4
Status unsat
Inferred Status None
Size 12917
Compressed Size2087
Max. Term Depth8
Asserts 93
Declared Functions0
Declared Constants72
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not88 or105 and16
=141 let3 /4 +100
-82 *70 <=48
Query 5
Status unsat
Inferred Status None
Size 20064
Compressed Size2609
Max. Term Depth8
Asserts 169
Declared Functions0
Declared Constants105
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not148 or181 and60
=313 let3 /4 +116
-94 *82 <=56
Query 6
Status sat
Inferred Status None
Size 28767
Compressed Size3126
Max. Term Depth8
Asserts 261
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not224 or277 and116
=529 let3 /4 +132
-106 *94 <=64
Query 7
Status sat
Inferred Status None
Size 38438
Compressed Size3779
Max. Term Depth8
Asserts 291
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not340 or421 and118
=643 let3 /16 +306
-250 *212 <=124
Query 8
Status sat
Inferred Status None
Size 46677
Compressed Size4284
Max. Term Depth8
Asserts 319
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not436 or544 and119
=738 let3 /18 +457
-373 *308 <=180
Query 9
Status unsat
Inferred Status None
Size 57570
Compressed Size4951
Max. Term Depth8
Asserts 356
Declared Functions0
Declared Constants138
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not562 or706 and120
=863 let3 /23 +656
-535 *440 <=254
Query 10
Status unsat
Inferred Status None
Size 66161
Compressed Size5540
Max. Term Depth8
Asserts 448
Declared Functions0
Declared Constants171
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not638 or802 and176
=1079 let3 /23 +672
-547 *452 <=262
Query 11
Status unsat
Inferred Status None
Size 74857
Compressed Size6022
Max. Term Depth8
Asserts 540
Declared Functions0
Declared Constants204
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not714 or898 and232
=1295 let3 /23 +688
-559 *464 <=270
Query 12
Status unsat
Inferred Status None
Size 83553
Compressed Size6451
Max. Term Depth8
Asserts 632
Declared Functions0
Declared Constants237
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not790 or994 and288
=1511 let3 /23 +704
-571 *476 <=278
Query 13
Status unsat
Inferred Status None
Size 92249
Compressed Size6853
Max. Term Depth8
Asserts 724
Declared Functions0
Declared Constants270
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not866 or1090 and344
=1727 let3 /23 +720
-583 *488 <=286
Query 14
Status unsat
Inferred Status None
Size 100945
Compressed Size7250
Max. Term Depth8
Asserts 816
Declared Functions0
Declared Constants303
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not942 or1186 and400
=1943 let3 /23 +736
-595 *500 <=294