| Name | GraphColoring/GraphColoring-m1-mono/ GraphColoring-queen8-8.xml |
| MD5SUM | 1f0f248e074ceb8e6b1804d1246bfc68 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 242.452 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 728 |
| Number of domains | 1 |
| Minimum domain size | 64 |
| Maximum domain size | 64 |
| Distribution of domain sizes | [{"size":64,"count":64}] |
| Minimum variable degree | 22 |
| Maximum variable degree | 28 |
| Distribution of variable degrees | [{"degree":22,"count":28},{"degree":24,"count":20},{"degree":26,"count":12},{"degree":28,"count":4}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 2 |
| Distribution of constraint arities | [{"arity":2,"count":728}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 728 |
| Distribution of constraint types | [{"type":"intension","count":728}] |
| 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: 8<instantiation id='sol3' type='solution' cost='8'> <list> x[] </list> <values> 6 3 7 4 1 0 2 5 7 1 0 2 3 6 4 8 0 6 8 1 4 2 7 3 8 5 4 7 6 3 1 0 4 2 1 8 0 5 6 7 5 0 3 6 2 4 8 1 3 7 2 0 8 1 5 4 1 4 6 3 5 7 0 2 </values> </instantiation>