| Name | PeacableArmies/ PeacableArmies-m2-10_c18.xml |
| MD5SUM | 8d1e20825fc8ffef49d443aea0d97595 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 14 |
| Best CPU time to get the best result obtained on this benchmark | 20056.3 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 102 |
| Number of constraints | 1473 |
| Number of domains | 2 |
| Minimum domain size | 3 |
| Maximum domain size | 50 |
| Distribution of domain sizes | [{"size":3,"count":100},{"size":50,"count":2}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 37 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":1},{"degree":29,"count":36},{"degree":31,"count":28},{"degree":33,"count":20},{"degree":35,"count":12},{"degree":37,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 101 |
| Distribution of constraint arities | [{"arity":2,"count":1471},{"arity":101,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1471 |
| Distribution of constraint types | [{"type":"intension","count":1471},{"type":"count","count":2}] |
| Optimization problem | YES |
| Type of objective | max VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297415 | SAT (TO) | 14 | 20056.3 | 2520.1 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291002 | SAT (TO) | 9 | 19907.8 | 2520.42 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308771 | SAT (TO) | 9 | 19929.6 | 2520.4 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 14<instantiation> <list>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[4][9] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[5][9] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[7][9] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] x[8][9] x[9][0] x[9][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8] x[9][9] nb nw </list> <values>2 2 2 2 2 0 0 0 0 0 0 2 2 2 2 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 2 2 0 0 0 0 0 0 0 0 2 2 2 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1 1 0 14 14 </values> </instantiation>