Benchmark

incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_1.25/grid/grid_08x08_k4_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
Size1017722
Compressed Size63819
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 calls12
Query 1
Status sat
Inferred Status None
Size 955489
Compressed Size61914
Max. Term Depth18
Asserts 8710
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not8619 or13249 and8191
=26932 let3 /3571 +72
-56 *56 <=44
Query 2
Status sat
Inferred Status None
Size 960020
Compressed Size62125
Max. Term Depth18
Asserts 8723
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not8671 or13314 and8191
=26984 let3 /3593 +150
-121 *108 <=70
Query 3
Status sat
Inferred Status None
Size 960929
Compressed Size62186
Max. Term Depth18
Asserts 8726
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not8680 or13326 and8191
=26993 let3 /3599 +165
-136 *117 <=76
Query 4
Status sat
Inferred Status None
Size 977335
Compressed Size62569
Max. Term Depth18
Asserts 8776
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not8861 or13557 and8191
=27174 let3 /3669 +446
-367 *317 <=176
Query 5
Status sat
Inferred Status None
Size 987316
Compressed Size62921
Max. Term Depth18
Asserts 8806
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not8974 or13700 and8191
=27287 let3 /3717 +619
-507 *437 <=236
Query 6
Status sat
Inferred Status None
Size 989308
Compressed Size62992
Max. Term Depth18
Asserts 8813
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not8995 or13728 and8191
=27308 let3 /3724 +654
-535 *458 <=250
Query 7
Status sat
Inferred Status None
Size 991300
Compressed Size63072
Max. Term Depth18
Asserts 8820
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not9016 or13756 and8191
=27329 let3 /3731 +689
-563 *479 <=264
Query 8
Status sat
Inferred Status None
Size 998645
Compressed Size63288
Max. Term Depth18
Asserts 8841
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not9100 or13861 and8191
=27413 let3 /3773 +815
-668 *563 <=306
Query 9
Status sat
Inferred Status None
Size 1000667
Compressed Size63350
Max. Term Depth18
Asserts 8848
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not9121 or13889 and8191
=27434 let3 /3779 +850
-696 *591 <=320
Query 10
Status sat
Inferred Status None
Size 1017451
Compressed Size63773
Max. Term Depth18
Asserts 8896
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not9312 or14128 and8191
=27625 let3 /3865 +1137
-923 *783 <=416
Query 11
Status sat
Inferred Status None
Size 1017588
Compressed Size63811
Max. Term Depth18
Asserts 8899
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not9312 or14128 and8191
=27625 let3 /3868 +1137
-923 *783 <=419
Query 12
Status sat
Inferred Status None
Size 1017690
Compressed Size63822
Max. Term Depth18
Asserts 8901
Declared Functions0
Declared Constants448
Declared Sorts 0
Defined Functions0
Defined Recursive Functions 0
Defined Sorts0
Constants0
Declared Datatypes0

Symbols

ite4 not9312 or14128 and8191
=27625 let3 /3870 +1137
-923 *783 <=421