| Name | GraphColoring/ GraphColoring-queen5-5_c18.xml |
| MD5SUM | e12c8a42b46a63e49e1504c0c9e3cd93 |
| 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.029582 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 25 |
| Number of constraints | 160 |
| Number of domains | 1 |
| Minimum domain size | 25 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":25,"count":25}] |
| Minimum variable degree | 13 |
| Maximum variable degree | 17 |
| Distribution of variable degrees | [{"degree":13,"count":16},{"degree":15,"count":8},{"degree":17,"count":1}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":160}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 160 |
| Distribution of constraint types | [{"type":"intension","count":160}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
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='solution' cost='4'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22] x[23] x[24] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 2 0 3 1 4 3 1 4 2 0 3 4 2 0 3 1 1 4 2 1 4 2 0 3 </values> </instantiation>