| Name | PeacableArmies/ PeacableArmies-m1-05_c18.xml |
| MD5SUM | 4b3a1ce7a352f102282a9a722b8ddb17 |
| 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 | 4.64126 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 50 |
| Number of constraints | 346 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":50}] |
| Minimum variable degree | 14 |
| Maximum variable degree | 19 |
| Distribution of variable degrees | [{"degree":14,"count":16},{"degree":15,"count":16},{"degree":16,"count":8},{"degree":17,"count":8},{"degree":18,"count":1},{"degree":19,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 50 |
| Distribution of constraint arities | [{"arity":2,"count":345},{"arity":50,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 345 |
| Distribution of constraint types | [{"type":"intension","count":345},{"type":"sum","count":1}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297406 | OPT | 4 | 4.64126 | 1.25428 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308762 | OPT | 4 | 7.31319 | 2.85452 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4290993 | OPT | 4 | 8.26402 | 3.07598 |
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> <list>b[0][0] b[0][1] b[0][2] b[0][3] b[0][4] b[1][0] b[1][1] b[1][2] b[1][3] b[1][4] b[2][0] b[2][1] b[2][2] b[2][3] b[2][4] b[3][0] b[3][1] b[3][2] b[3][3] b[3][4] b[4][0] b[4][1] b[4][2] b[4][3] b[4][4] w[0][0] w[0][1] w[0][2] w[0][3] w[0][4] w[1][0] w[1][1] w[1][2] w[1][3] w[1][4] w[2][0] w[2][1] w[2][2] w[2][3] w[2][4] w[3][0] w[3][1] w[3][2] w[3][3] w[3][4] w[4][0] w[4][1] w[4][2] w[4][3] w[4][4] </list> <values>1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 </values> </instantiation>