Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_08x08_k2_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
Size1021109
Compressed Size73144
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 calls13
Query 1
Status sat
Inferred Status None
Size 962161
Compressed Size69955
Max. Term Depth9
Asserts 9670
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not9415 or13109 and7952
=27744 let5 +228 -174
*174 <=126
Query 2
Status sat
Inferred Status None
Size 967786
Compressed Size70350
Max. Term Depth9
Asserts 9687
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not9483 or13192 and7954
=27810 let5 /4 +328
-257 *240 <=160
Query 3
Status sat
Inferred Status None
Size 982302
Compressed Size71027
Max. Term Depth9
Asserts 9732
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not9654 or13408 and7954
=27981 let5 /12 +589
-472 *416 <=250
Query 4
Status sat
Inferred Status None
Size 988496
Compressed Size71368
Max. Term Depth9
Asserts 9752
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not9725 or13499 and7954
=28052 let5 /18 +700
-562 *491 <=290
Query 5
Status sat
Inferred Status None
Size 994836
Compressed Size71748
Max. Term Depth9
Asserts 9772
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not9799 or13593 and7954
=28126 let5 /22 +814
-656 *565 <=330
Query 6
Status sat
Inferred Status None
Size 997943
Compressed Size71937
Max. Term Depth9
Asserts 9782
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not9835 or13638 and7955
=28161 let5 /24 +869
-701 *604 <=350
Query 7
Status sat
Inferred Status None
Size 1008565
Compressed Size72504
Max. Term Depth9
Asserts 9815
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not9960 or13796 and7955
=28286 let5 /32 +1060
-859 *729 <=416
Query 8
Status sat
Inferred Status None
Size 1013718
Compressed Size72755
Max. Term Depth9
Asserts 9833
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not10017 or13871 and7955
=28343 let5 /34 +1153
-934 *793 <=452
Query 9
Status sat
Inferred Status None
Size 1016409
Compressed Size72856
Max. Term Depth9
Asserts 9841
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not10049 or13911 and7955
=28375 let5 /34 +1201
-974 *825 <=468
Query 10
Status sat
Inferred Status None
Size 1018136
Compressed Size72948
Max. Term Depth9
Asserts 9846
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not10069 or13936 and7955
=28395 let5 /38 +1231
-999 *845 <=478
Query 11
Status sat
Inferred Status None
Size 1019550
Compressed Size73018
Max. Term Depth9
Asserts 9851
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not10084 or13956 and7955
=28410 let5 /38 +1256
-1019 *864 <=488
Query 12
Status sat
Inferred Status None
Size 1021001
Compressed Size73112
Max. Term Depth9
Asserts 9856
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not10100 or13977 and7955
=28426 let5 /38 +1282
-1040 *880 <=498
Query 13
Status sat
Inferred Status None
Size 1021093
Compressed Size73141
Max. Term Depth9
Asserts 9858
Declared Functions0
Declared Constants610
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not10100 or13977 and7955
=28426 let5 /39 +1282
-1040 *880 <=500