Benchmark
incremental/QF_BVLRA/20240414-mapf_r/makespan/coef_2/grid/grid_04x04_k2_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 |
|---|
| Size | 26967 |
| Compressed Size | 3220 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | — |
| Generated By | Tomas Kolarik |
| Generated On | 2024-04-14 00:00:00 |
| Generator | gitlab.com/Tomaqa/mapf_r |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 5 |
| Status | sat |
| Inferred Status | None |
| Size | 22178 |
| Compressed Size | 2820 |
| Max. Term Depth | 6 |
| Asserts | 211 |
| Declared Functions | 0 |
| Declared Constants | 86 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
ite | 2 |
not | 172 |
or | 227 |
and | 132 |
= | 487 |
let | 1 |
+ | 28 |
- | 22 |
* | 22 |
<= | 18 |
| | | |
| Status | sat |
| Inferred Status | None |
| Size | 24165 |
| Compressed Size | 3000 |
| Max. Term Depth | 8 |
| Asserts | 217 |
| Declared Functions | 0 |
| Declared Constants | 86 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
ite | 2 |
not | 196 |
or | 256 |
and | 133 |
= | 510 |
let | 1 |
/ | 2 |
+ | 63 |
- | 50 |
* | 45 |
<= | 30 |
| |
| Status | sat |
| Inferred Status | None |
| Size | 24816 |
| Compressed Size | 3058 |
| Max. Term Depth | 8 |
| Asserts | 219 |
| Declared Functions | 0 |
| Declared Constants | 86 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
ite | 2 |
not | 204 |
or | 265 |
and | 134 |
= | 517 |
let | 1 |
/ | 2 |
+ | 74 |
- | 59 |
* | 52 |
<= | 34 |
| |
| Status | sat |
| Inferred Status | None |
| Size | 26859 |
| Compressed Size | 3207 |
| Max. Term Depth | 8 |
| Asserts | 225 |
| Declared Functions | 0 |
| Declared Constants | 86 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
ite | 2 |
not | 228 |
or | 295 |
and | 134 |
= | 541 |
let | 1 |
/ | 6 |
+ | 110 |
- | 89 |
* | 76 |
<= | 46 |
| |
| Status | sat |
| Inferred Status | None |
| Size | 26951 |
| Compressed Size | 3230 |
| Max. Term Depth | 8 |
| Asserts | 227 |
| Declared Functions | 0 |
| Declared Constants | 86 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
ite | 2 |
not | 228 |
or | 295 |
and | 134 |
= | 541 |
let | 1 |
/ | 7 |
+ | 110 |
- | 89 |
* | 76 |
<= | 48 |
| |