Benchmark

incremental/QF_BVLRA/20240414-mapf_r/soc/coef_1.25/grid/grid_08x08_k5_k3_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
Size421000
Compressed Size22904
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 282829
Compressed Size19394
Max. Term Depth34
Asserts 2486
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2441 or3756 and2361 =7585
/1142 +33 -27 *27
<=18
Query 2
Status sat
Inferred Status None
Size 283174
Compressed Size19480
Max. Term Depth34
Asserts 2487
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2445 or3760 and2362 =7588
/1144 +38 -32 *30
<=20
Query 3
Status sat
Inferred Status None
Size 294966
Compressed Size20015
Max. Term Depth34
Asserts 2522
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2580 or3929 and2363 =7722
/1208 +242 -188 *169
<=90
Query 4
Status sat
Inferred Status None
Size 305517
Compressed Size20373
Max. Term Depth34
Asserts 2553
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2700 or4080 and2363 =7842
/1269 +424 -321 *293
<=152
Query 5
Status sat
Inferred Status None
Size 305862
Compressed Size20393
Max. Term Depth34
Asserts 2554
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2704 or4084 and2364 =7845
/1271 +429 -326 *296
<=154
Query 6
Status sat
Inferred Status None
Size 306007
Compressed Size20444
Max. Term Depth34
Asserts 2557
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2704 or4084 and2364 =7845
/1274 +429 -326 *296
<=157
Query 7
Status sat
Inferred Status None
Size 310507
Compressed Size20670
Max. Term Depth34
Asserts 2570
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2756 or4148 and2365 =7896
/1300 +506 -384 *347
<=183
Query 8
Status sat
Inferred Status None
Size 315006
Compressed Size20917
Max. Term Depth34
Asserts 2583
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2808 or4212 and2366 =7947
/1323 +583 -449 *398
<=209
Query 9
Status sat
Inferred Status None
Size 316206
Compressed Size21025
Max. Term Depth34
Asserts 2587
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not2821 or4228 and2367 =7959
/1329 +603 -468 *410
<=217
Query 10
Status sat
Inferred Status None
Size 336214
Compressed Size21942
Max. Term Depth34
Asserts 2647
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3049 or4515 and2368 =8186
/1425 +950 -765 *637
<=337
Query 11
Status unsat
Inferred Status None
Size 352112
Compressed Size22657
Max. Term Depth34
Asserts 2695
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3230 or4743 and2369 =8366
/1500 +1226 -987 *828
<=433
Query 12
Status sat
Inferred Status None
Size 374795
Compressed Size22709
Max. Term Depth34
Asserts 2762
Declared Functions0
Declared Constants349
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

not3493 or5071 and2372 =8626
/1628 +1622 -1286 *1097
<=568