Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.5/grid/grid_08x08_k4_k6_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
Size2410755
Compressed Size151871
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 calls11
Query 1
Status sat
Inferred Status None
Size 2258017
Compressed Size145041
Max. Term Depth19
Asserts 20677
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not20518 or31468 and19513
=63980 let5 /8430 +132
-102 *102 <=78
Query 2
Status sat
Inferred Status None
Size 2275156
Compressed Size145977
Max. Term Depth19
Asserts 20729
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not20716 or31714 and19517
=64174 let5 /8501 +430
-346 *306 <=182
Query 3
Status sat
Inferred Status None
Size 2300981
Compressed Size147159
Max. Term Depth19
Asserts 20808
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not21009 or32086 and19517
=64467 let5 /8607 +881
-719 *615 <=340
Query 4
Status sat
Inferred Status None
Size 2353301
Compressed Size149171
Max. Term Depth19
Asserts 20965
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not21606 or32839 and19518
=65063 let5 /8841 +1791
-1475 *1211 <=654
Query 5
Status sat
Inferred Status None
Size 2368384
Compressed Size149884
Max. Term Depth19
Asserts 21014
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not21773 or33055 and19518
=65230 let5 /8894 +2056
-1704 *1385 <=752
Query 6
Status sat
Inferred Status None
Size 2381436
Compressed Size150463
Max. Term Depth19
Asserts 21053
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not21920 or33241 and19518
=65377 let5 /8962 +2281
-1891 *1539 <=830
Query 7
Status sat
Inferred Status None
Size 2391285
Compressed Size150944
Max. Term Depth19
Asserts 21083
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not22033 or33384 and19518
=65490 let5 /8998 +2454
-2034 *1652 <=890
Query 8
Status sat
Inferred Status None
Size 2397209
Compressed Size151219
Max. Term Depth19
Asserts 21100
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not22101 or33469 and19518
=65558 let5 /9030 +2556
-2119 *1720 <=924
Query 9
Status sat
Inferred Status None
Size 2397346
Compressed Size151269
Max. Term Depth19
Asserts 21103
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not22101 or33469 and19518
=65558 let5 /9033 +2556
-2119 *1720 <=927
Query 10
Status sat
Inferred Status None
Size 2405078
Compressed Size151603
Max. Term Depth19
Asserts 21125
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not22189 or33579 and19518
=65646 let5 /9074 +2688
-2242 *1808 <=971
Query 11
Status sat
Inferred Status None
Size 2410731
Compressed Size151880
Max. Term Depth19
Asserts 21141
Declared Functions0
Declared Constants802
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not22253 or33659 and19518
=65710 let5 /9105 +2784
-2333 *1872 <=1003