| Name | PeacableArmies/ PeacableArmies-m2-05_c18.xml |
| MD5SUM | 5e5be4f605afa886fe94f4d001b03361 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 4 |
| Best CPU time to get the best result obtained on this benchmark | 0.505646 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 27 |
| Number of constraints | 163 |
| Number of domains | 2 |
| Minimum domain size | 3 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":3,"count":25},{"size":12,"count":2}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 18 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":1},{"degree":14,"count":16},{"degree":16,"count":8},{"degree":18,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 26 |
| Distribution of constraint arities | [{"arity":2,"count":161},{"arity":26,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 161 |
| Distribution of constraint types | [{"type":"intension","count":161},{"type":"count","count":2}] |
| Optimization problem | YES |
| Type of objective | max VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Mistral-2.0 2018-08-01 (complete) | 4312690 | OPT | 4 | 0.447933 | 0.452945 |
| cosoco 1.12 (complete) | 4301974 | OPT | 4 | 0.505646 | 0.507839 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301972 | OPT | 4 | 1.75198 | 0.765366 |
| Sat4j-CSP 2018-07-11 (complete) | 4301973 | OPT | 4 | 1.79706 | 0.963455 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312151 | OPT | 4 | 15.8458 | 13.3396 |
| Concrete 3.9.2-SuperNG (complete) | 4302665 | OPT | 4 | 36.1192 | 25.3333 |
| Concrete 3.9.2 (complete) | 4302315 | OPT | 4 | 44.4837 | 35.4016 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310291 | SAT (TO) | 4 | 252.077 | 245.126 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309941 | SAT (TO) | 4 | 252.1 | 246.517 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 4<instantiation type="optimum" cost="4"> <list> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] nb nw </list> <values> 0 0 2 0 2 1 0 0 0 0 0 0 2 0 2 1 0 0 0 0 0 1 0 1 0 4 4 </values> </instantiation>