| Name | GraphColoring/GraphColoring-m1-fixed/ GraphColoring-qwhopt-o5-h10-1.xml |
| MD5SUM | 4716a87298188d70bc9d7e045ef51dee |
| 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.073991999 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 25 |
| Number of constraints | 101 |
| Number of domains | 1 |
| Minimum domain size | 25 |
| Maximum domain size | 25 |
| Distribution of domain sizes | [{"size":25,"count":25}] |
| Minimum variable degree | 9 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":9,"count":10},{"degree":10,"count":15}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":2,"count":100},{"arity":15,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 100 |
| Distribution of constraint types | [{"type":"intension","count":100},{"type":"instantiation","count":1}] |
| 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="optimum" cost="4"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] </list> <values> 0 1 4 3 2 3 4 1 2 0 1 0 2 4 3 2 3 0 1 4 4 2 3 0 1 </values> </instantiation>