| Name | ChessboardColoration/ChessboardColoration-int-s1/ ChessboardColoration-int-13-13.xml |
| MD5SUM | 35fa3ccff61e9a72252c43058d5bc461 |
| 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 | 245.22701 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 169 |
| Number of constraints | 6085 |
| Number of domains | 1 |
| Minimum domain size | 169 |
| Maximum domain size | 169 |
| Distribution of domain sizes | [{"size":169,"count":169}] |
| Minimum variable degree | 146 |
| Maximum variable degree | 146 |
| Distribution of variable degrees | [{"degree":146,"count":169}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 169 |
| Distribution of constraint arities | [{"arity":4,"count":6084},{"arity":169,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 6084 |
| Distribution of constraint types | [{"type":"intension","count":6084},{"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='sol3' type='solution' cost='3'> <list> x[][] </list> <values> 0 0 0 0 1 1 1 1 1 1 2 3 3 0 1 1 3 0 0 1 2 2 2 3 0 1 0 1 2 2 2 3 0 0 1 2 3 1 0 0 2 2 1 3 1 3 2 0 0 1 1 3 1 0 1 2 1 2 2 2 3 0 3 0 0 1 0 3 1 2 0 0 2 3 1 2 2 2 1 2 3 0 0 2 3 1 0 2 3 1 0 1 2 3 3 2 0 2 0 1 0 1 3 1 2 0 1 1 0 3 2 0 1 2 0 3 2 2 2 0 2 1 0 3 3 2 3 2 1 0 2 3 0 3 2 2 0 3 0 1 0 0 1 3 1 2 0 1 2 0 3 3 0 1 3 2 3 1 2 1 3 3 2 1 2 3 0 2 0 </values> </instantiation>