Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_08x08_k4_k7_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
Size3891143
Compressed Size230968
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 3556545
Compressed Size216342
Max. Term Depth19
Asserts 32650
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not32437 or49656 and30845
=100948 let6 /13251 +182
-140 *140 <=105
Query 2
Status sat
Inferred Status None
Size 3690519
Compressed Size221670
Max. Term Depth19
Asserts 33046
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not33975 or51590 and30845
=102486 let6 /13819 +2512
-2061 *1712 <=897
Query 3
Status sat
Inferred Status None
Size 3753533
Compressed Size224255
Max. Term Depth19
Asserts 33236
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not34698 or52502 and30846
=103208 let6 /14059 +3614
-2988 *2450 <=1277
Query 4
Status sat
Inferred Status None
Size 3787965
Compressed Size226024
Max. Term Depth19
Asserts 33343
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not35084 or52995 and30846
=103594 let6 /14208 +4214
-3496 *2856 <=1491
Query 5
Status sat
Inferred Status None
Size 3816068
Compressed Size227393
Max. Term Depth19
Asserts 33435
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not35394 or53397 and30846
=103904 let6 /14308 +4708
-3901 *3206 <=1675
Query 6
Status sat
Inferred Status None
Size 3851142
Compressed Size229091
Max. Term Depth19
Asserts 33544
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not35788 or53900 and30846
=104298 let6 /14450 +5320
-4411 *3608 <=1893
Query 7
Status sat
Inferred Status None
Size 3875804
Compressed Size230289
Max. Term Depth19
Asserts 33616
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not36071 or54255 and30846
=104581 let6 /14575 +5747
-4753 *3896 <=2037
Query 8
Status sat
Inferred Status None
Size 3883292
Compressed Size230595
Max. Term Depth19
Asserts 33639
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not36154 or54361 and30846
=104664 let6 /14613 +5876
-4871 *3979 <=2083
Query 9
Status sat
Inferred Status None
Size 3890355
Compressed Size230858
Max. Term Depth19
Asserts 33662
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not36232 or54462 and30846
=104742 let6 /14637 +6000
-4976 *4057 <=2129
Query 10
Status sat
Inferred Status None
Size 3890973
Compressed Size230903
Max. Term Depth19
Asserts 33664
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not36238 or54470 and30846
=104748 let6 /14641 +6010
-4986 *4063 <=2133
Query 11
Status sat
Inferred Status None
Size 3891119
Compressed Size230958
Max. Term Depth19
Asserts 33667
Declared Functions0
Declared Constants1089
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite7 not36238 or54470 and30846
=104748 let6 /14644 +6010
-4986 *4063 <=2136