| Name | ChessboardColoration/ChessboardColoration-int-s1/ ChessboardColoration-int-15-15.xml |
| MD5SUM | 31b93d68041edb8c4e758991fee87633 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 4 |
| Best CPU time to get the best result obtained on this benchmark | 249.96201 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 225 |
| Number of constraints | 11026 |
| Number of domains | 1 |
| Minimum domain size | 225 |
| Maximum domain size | 225 |
| Distribution of domain sizes | [{"size":225,"count":225}] |
| Minimum variable degree | 198 |
| Maximum variable degree | 198 |
| Distribution of variable degrees | [{"degree":198,"count":225}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 225 |
| Distribution of constraint arities | [{"arity":4,"count":11025},{"arity":225,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 11025 |
| Distribution of constraint types | [{"type":"intension","count":11025},{"type":"lex","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 id='sol2' type='solution' cost='4'> <list> x[][] </list> <values> 0 0 0 0 0 0 0 0 0 1 1 1 1 2 2 0 1 1 1 1 1 1 2 2 2 2 2 3 0 0 0 1 2 2 2 3 3 3 3 0 0 4 1 1 4 0 2 2 3 3 1 2 3 4 3 3 4 1 2 1 0 2 3 2 4 2 1 3 1 2 4 3 2 1 3 0 2 3 4 1 4 3 2 1 1 3 0 4 3 4 0 3 3 3 2 1 2 1 4 1 4 2 0 1 4 0 3 4 1 2 2 3 1 1 3 2 1 3 2 1 1 4 0 2 3 1 2 2 1 4 0 3 0 0 2 1 4 1 0 4 2 2 1 3 3 0 0 1 4 3 1 4 3 1 3 3 2 0 2 0 1 0 2 0 4 1 4 4 4 2 0 1 3 2 1 4 0 3 3 0 2 2 4 3 2 0 1 1 3 0 1 3 0 3 2 2 3 1 0 4 4 2 3 4 4 2 1 0 1 0 2 3 4 2 1 3 0 1 2 0 3 3 4 2 0 </values> </instantiation>