Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_08x08_k4_k9_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
Size3559727
Compressed Size221923
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 calls10
Query 1
Status sat
Inferred Status None
Size 3299898
Compressed Size211698
Max. Term Depth19
Asserts 30223
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not29986 or45989 and28517
=93505 let8 /12319 +198
-153 *153 <=117
Query 2
Status sat
Inferred Status None
Size 3395935
Compressed Size215274
Max. Term Depth19
Asserts 30505
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not31098 or47382 and28518
=94616 let8 /12678 +1873
-1539 *1271 <=681
Query 3
Status sat
Inferred Status None
Size 3433005
Compressed Size217000
Max. Term Depth19
Asserts 30620
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not31516 or47915 and28518
=95034 let8 /12831 +2521
-2070 *1719 <=911
Query 4
Status sat
Inferred Status None
Size 3467556
Compressed Size218197
Max. Term Depth19
Asserts 30733
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not31895 or48407 and28518
=95413 let8 /12936 +3126
-2567 *2154 <=1137
Query 5
Status sat
Inferred Status None
Size 3500290
Compressed Size219624
Max. Term Depth19
Asserts 30831
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not32271 or48881 and28518
=95789 let8 /13075 +3698
-3033 *2544 <=1333
Query 6
Status sat
Inferred Status None
Size 3527902
Compressed Size220747
Max. Term Depth19
Asserts 30924
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not32574 or49277 and28518
=96092 let8 /13166 +4187
-3442 *2847 <=1519
Query 7
Status sat
Inferred Status None
Size 3534417
Compressed Size221062
Max. Term Depth19
Asserts 30943
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not32648 or49370 and28518
=96166 let8 /13202 +4299
-3537 *2921 <=1557
Query 8
Status sat
Inferred Status None
Size 3547044
Compressed Size221610
Max. Term Depth19
Asserts 30981
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not32793 or49553 and28518
=96311 let8 /13253 +4520
-3720 *3066 <=1633
Query 9
Status sat
Inferred Status None
Size 3559604
Compressed Size221956
Max. Term Depth19
Asserts 31019
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not32938 or49736 and28518
=96456 let8 /13283 +4741
-3903 *3211 <=1709
Query 10
Status sat
Inferred Status None
Size 3559711
Compressed Size221999
Max. Term Depth19
Asserts 31021
Declared Functions0
Declared Constants1201
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite9 not32938 or49736 and28518
=96456 let8 /13285 +4741
-3903 *3211 <=1711