| Name | PeacableArmies/ PeacableArmies-m1-07_c18.xml |
| MD5SUM | 93689e7972bcd89c8c0248fcf1fc8ef9 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 7 |
| Best CPU time to get the best result obtained on this benchmark | 112.098 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 98 |
| Number of constraints | 1002 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":98}] |
| Minimum variable degree | 20 |
| Maximum variable degree | 27 |
| Distribution of variable degrees | [{"degree":20,"count":24},{"degree":21,"count":24},{"degree":22,"count":16},{"degree":23,"count":16},{"degree":24,"count":8},{"degree":25,"count":8},{"degree":26,"count":1},{"degree":27,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 98 |
| Distribution of constraint arities | [{"arity":2,"count":1001},{"arity":98,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1001 |
| Distribution of constraint types | [{"type":"intension","count":1001},{"type":"sum","count":1}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4290994 | OPT | 7 | 48.4989 | 8.23011 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308763 | OPT | 7 | 50.3591 | 8.35819 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297407 | OPT | 7 | 112.098 | 16.0357 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 7<instantiation> <list> b[0][0] b[0][1] b[0][2] b[0][3] b[0][4] b[0][5] b[0][6] b[1][0] b[1][1] b[1][2] b[1][3] b[1][4] b[1][5] b[1][6] b[2][0] b[2][1] b[2][2] b[2][3] b[2][4] b[2][5] b[2][6] b[3][0] b[3][1] b[3][2] b[3][3] b[3][4] b[3][5] b[3][6] b[4][0] b[4][1] b[4][2] b[4][3] b[4][4] b[4][5] b[4][6] b[5][0] b[5][1] b[5][2] b[5][3] b[5][4] b[5][5] b[5][6] b[6][0] b[6][1] b[6][2] b[6][3] b[6][4] b[6][5] b[6][6] w[0][0] w[0][1] w[0][2] w[0][3] w[0][4] w[0][5] w[0][6] w[1][0] w[1][1] w[1][2] w[1][3] w[1][4] w[1][5] w[1][6] w[2][0] w[2][1] w[2][2] w[2][3] w[2][4] w[2][5] w[2][6] w[3][0] w[3][1] w[3][2] w[3][3] w[3][4] w[3][5] w[3][6] w[4][0] w[4][1] w[4][2] w[4][3] w[4][4] w[4][5] w[4][6] w[5][0] w[5][1] w[5][2] w[5][3] w[5][4] w[5][5] w[5][6] w[6][0] w[6][1] w[6][2] w[6][3] w[6][4] w[6][5] w[6][6] </list> <values> 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 1 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>