Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_08x08_k2_k15_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
Size2565779
Compressed Size179982
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 2443843
Compressed Size173256
Max. Term Depth18
Asserts 24273
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not23640 or32946 and20010
=69794 let14 +570 -435
*435 <=315
Query 2
Status sat
Inferred Status None
Size 2472583
Compressed Size174949
Max. Term Depth18
Asserts 24361
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not23978 or33366 and20016
=70126 let14 /14 +1078
-852 *780 <=491
Query 3
Status sat
Inferred Status None
Size 2486197
Compressed Size175814
Max. Term Depth18
Asserts 24405
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not24131 or33563 and20016
=70279 let14 /28 +1319
-1049 *954 <=579
Query 4
Status sat
Inferred Status None
Size 2500305
Compressed Size176548
Max. Term Depth18
Asserts 24451
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not24291 or33769 and20016
=70439 let14 /31 +1571
-1255 *1124 <=671
Query 5
Status sat
Inferred Status None
Size 2517611
Compressed Size177483
Max. Term Depth18
Asserts 24506
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not24491 or34023 and20017
=70638 let14 /38 +1880
-1508 *1332 <=781
Query 6
Status sat
Inferred Status None
Size 2529224
Compressed Size178045
Max. Term Depth18
Asserts 24541
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not24627 or34194 and20017
=70774 let14 /46 +2086
-1679 *1468 <=851
Query 7
Status sat
Inferred Status None
Size 2539312
Compressed Size178586
Max. Term Depth18
Asserts 24574
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not24740 or34340 and20017
=70887 let14 /50 +2265
-1825 *1587 <=917
Query 8
Status sat
Inferred Status None
Size 2548551
Compressed Size179023
Max. Term Depth18
Asserts 24602
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not24848 or34476 and20017
=70995 let14 /54 +2429
-1960 *1699 <=973
Query 9
Status sat
Inferred Status None
Size 2553488
Compressed Size179277
Max. Term Depth18
Asserts 24619
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not24902 or34547 and20017
=71049 let14 /56 +2517
-2031 *1758 <=1007
Query 10
Status sat
Inferred Status None
Size 2556496
Compressed Size179489
Max. Term Depth18
Asserts 24629
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not24936 or34590 and20018
=71082 let14 /58 +2570
-2074 *1797 <=1027
Query 11
Status sat
Inferred Status None
Size 2563523
Compressed Size179823
Max. Term Depth18
Asserts 24650
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not25019 or34692 and20020
=71163 let14 /60 +2693
-2176 *1878 <=1069
Query 12
Status sat
Inferred Status None
Size 2565635
Compressed Size179929
Max. Term Depth18
Asserts 24656
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not25043 or34722 and20020
=71187 let14 /64 +2729
-2206 *1902 <=1081
Query 13
Status sat
Inferred Status None
Size 2565755
Compressed Size179975
Max. Term Depth18
Asserts 24659
Declared Functions0
Declared Constants1519
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite15 not25043 or34722 and20020
=71187 let14 /65 +2729
-2206 *1902 <=1084