Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.5/grid/grid_08x08_k2_k14_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
Size3494194
Compressed Size246175
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 3392054
Compressed Size240200
Max. Term Depth17
Asserts 33565
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not32862 or45745 and27831
=96869 let13 +644 -490
*490 <=350
Query 2
Status sat
Inferred Status None
Size 3414015
Compressed Size241788
Max. Term Depth17
Asserts 33635
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not33123 or46064 and27843
=97118 let13 /8 +1033
-809 *754 <=490
Query 3
Status sat
Inferred Status None
Size 3430807
Compressed Size242770
Max. Term Depth17
Asserts 33686
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not33321 or46311 and27845
=97314 let13 /27 +1331
-1056 *952 <=592
Query 4
Status sat
Inferred Status None
Size 3449758
Compressed Size243788
Max. Term Depth17
Asserts 33746
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not33543 or46593 and27845
=97536 let13 /35 +1673
-1338 *1176 <=712
Query 5
Status sat
Inferred Status None
Size 3468565
Compressed Size244868
Max. Term Depth17
Asserts 33806
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not33761 or46870 and27846
=97753 let13 /41 +2010
-1614 *1406 <=832
Query 6
Status sat
Inferred Status None
Size 3480451
Compressed Size245495
Max. Term Depth17
Asserts 33842
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not33899 or47044 and27846
=97891 let13 /58 +2220
-1788 *1549 <=904
Query 7
Status sat
Inferred Status None
Size 3487046
Compressed Size245897
Max. Term Depth17
Asserts 33865
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not33971 or47139 and27846
=97963 let13 /60 +2338
-1883 *1633 <=950
Query 8
Status sat
Inferred Status None
Size 3490843
Compressed Size246128
Max. Term Depth17
Asserts 33878
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not34013 or47194 and27846
=98005 let13 /62 +2406
-1938 *1675 <=976
Query 9
Status sat
Inferred Status None
Size 3492998
Compressed Size246256
Max. Term Depth17
Asserts 33885
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not34037 or47225 and27846
=98029 let13 /64 +2444
-1969 *1700 <=990
Query 10
Status sat
Inferred Status None
Size 3494045
Compressed Size246273
Max. Term Depth17
Asserts 33888
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not34049 or47240 and27846
=98041 let13 /66 +2462
-1984 *1712 <=996
Query 11
Status sat
Inferred Status None
Size 3494170
Compressed Size246316
Max. Term Depth17
Asserts 33891
Declared Functions0
Declared Constants1698
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite14 not34049 or47240 and27846
=98041 let13 /68 +2462
-1984 *1712 <=999