Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k3_k6_C.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
Size308625
Compressed Size20209
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 138688
Compressed Size11446
Max. Term Depth11
Asserts 1297
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1186 or1712 and1045
=3568 let5 /276 +84
-66 *66 <=54
Query 2
Status sat
Inferred Status None
Size 163893
Compressed Size12681
Max. Term Depth11
Asserts 1375
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1479 or2080 and1048
=3858 let5 /351 +530
-426 *370 <=210
Query 3
Status sat
Inferred Status None
Size 192367
Compressed Size13960
Max. Term Depth11
Asserts 1462
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not1810 or2498 and1048
=4189 let5 /426 +1035
-836 *710 <=384
Query 4
Status sat
Inferred Status None
Size 213045
Compressed Size15160
Max. Term Depth11
Asserts 1525
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not2049 or2799 and1049
=4427 let5 /501 +1399
-1137 *954 <=510
Query 5
Status sat
Inferred Status None
Size 228780
Compressed Size16072
Max. Term Depth11
Asserts 1575
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not2231 or3030 and1050
=4608 let5 /548 +1680
-1368 *1138 <=610
Query 6
Status sat
Inferred Status None
Size 248590
Compressed Size17060
Max. Term Depth11
Asserts 1634
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not2461 or3319 and1050
=4838 let5 /617 +2028
-1660 *1368 <=728
Query 7
Status sat
Inferred Status None
Size 274329
Compressed Size18313
Max. Term Depth11
Asserts 1717
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not2755 or3695 and1051
=5131 let5 /676 +2487
-2041 *1669 <=894
Query 8
Status sat
Inferred Status None
Size 290732
Compressed Size19256
Max. Term Depth11
Asserts 1770
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not2941 or3931 and1054
=5314 let5 /731 +2776
-2282 *1862 <=1000
Query 9
Status sat
Inferred Status None
Size 305090
Compressed Size19978
Max. Term Depth11
Asserts 1817
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not3104 or4141 and1054
=5477 let5 /769 +3033
-2489 *2039 <=1094
Query 10
Status sat
Inferred Status None
Size 308508
Compressed Size20184
Max. Term Depth11
Asserts 1827
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not3144 or4191 and1054
=5517 let5 /780 +3093
-2540 *2079 <=1114
Query 11
Status sat
Inferred Status None
Size 308609
Compressed Size20219
Max. Term Depth11
Asserts 1829
Declared Functions0
Declared Constants346
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite6 not3144 or4191 and1054
=5517 let5 /781 +3093
-2540 *2079 <=1116