Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/grid/grid_04x04_k5_k4_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
Size226873
Compressed Size14259
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 calls12
Query 1
Status sat
Inferred Status None
Size 17896
Compressed Size2375
Max. Term Depth14
Asserts 136
Declared Functions0
Declared Constants152
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not93 or137 and69
=281 let3 /32 +24
-20 *20 <=20
Query 2
Status sat
Inferred Status None
Size 29969
Compressed Size3059
Max. Term Depth14
Asserts 171
Declared Functions0
Declared Constants152
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not233 or312 and69
=421 let3 /97 +234
-195 *160 <=90
Query 3
Status sat
Inferred Status None
Size 32057
Compressed Size3261
Max. Term Depth14
Asserts 178
Declared Functions0
Declared Constants152
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not256 or340 and71
=442 let3 /110 +269
-226 *184 <=104
Query 4
Status unsat
Inferred Status None
Size 32971
Compressed Size3354
Max. Term Depth14
Asserts 181
Declared Functions0
Declared Constants152
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not266 or352 and72
=451 let3 /115 +284
-238 *195 <=110
Query 5
Status sat
Inferred Status None
Size 129110
Compressed Size10173
Max. Term Depth15
Asserts 1060
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not1129 or1698 and882
=3200 let3 /495 +300
-250 *207 <=118
Query 6
Status sat
Inferred Status None
Size 155337
Compressed Size11290
Max. Term Depth15
Asserts 1139
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not1429 or2077 and882
=3500 let3 /605 +758
-644 *519 <=276
Query 7
Status sat
Inferred Status None
Size 155976
Compressed Size11354
Max. Term Depth15
Asserts 1141
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not1437 or2085 and884
=3506 let3 /608 +768
-653 *525 <=280
Query 8
Status sat
Inferred Status None
Size 159777
Compressed Size11616
Max. Term Depth15
Asserts 1152
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not1481 or2140 and884
=3550 let3 /627 +834
-708 *569 <=302
Query 9
Status sat
Inferred Status None
Size 159913
Compressed Size11655
Max. Term Depth15
Asserts 1155
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not1481 or2140 and884
=3550 let3 /630 +834
-708 *569 <=305
Query 10
Status sat
Inferred Status None
Size 185561
Compressed Size12846
Max. Term Depth15
Asserts 1232
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not1776 or2512 and884
=3845 let3 /739 +1283
-1094 *875 <=459
Query 11
Status sat
Inferred Status None
Size 206534
Compressed Size13863
Max. Term Depth15
Asserts 1297
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2014 or2815 and884
=4083 let3 /843 +1651
-1399 *1122 <=589
Query 12
Status sat
Inferred Status None
Size 211311
Compressed Size14089
Max. Term Depth15
Asserts 1311
Declared Functions0
Declared Constants225
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not2068 or2883 and884
=4137 let3 /870 +1733
-1473 *1176 <=617