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