| Name | ChessboardColoration/ChessboardColoration-int-s2/ ChessboardColoration-int-16-18.xml |
| MD5SUM | dd156cd3c4e4f48d7499665f65319a51 |
| 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 | 253.7 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 288 |
| Number of constraints | 18361 |
| Number of domains | 1 |
| Minimum domain size | 288 |
| Maximum domain size | 288 |
| Distribution of domain sizes | [{"size":288,"count":288}] |
| Minimum variable degree | 257 |
| Maximum variable degree | 257 |
| Distribution of variable degrees | [{"degree":257,"count":288}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 288 |
| Distribution of constraint arities | [{"arity":4,"count":18360},{"arity":288,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 18360 |
| Distribution of constraint types | [{"type":"intension","count":18360},{"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='sol3' type='solution' cost='4'> <list> x[][] </list> <values> 0 0 0 1 1 1 1 1 1 1 2 2 2 2 3 3 4 4 0 1 2 1 2 2 2 2 3 3 0 4 4 4 1 4 1 1 0 3 4 2 1 2 3 3 0 2 1 3 3 3 4 0 1 4 0 3 4 4 0 3 1 4 2 3 3 0 1 2 1 2 4 3 0 4 2 2 3 0 4 4 1 0 1 3 4 2 0 1 0 1 1 0 3 0 4 1 2 0 0 0 0 4 2 3 2 1 1 2 1 1 0 4 3 4 2 0 1 2 2 0 1 3 3 2 2 4 1 2 0 0 3 2 0 1 2 3 2 4 3 1 0 3 4 1 1 2 1 0 3 4 2 3 4 1 3 0 4 2 1 0 0 0 1 2 2 0 1 0 3 4 3 2 3 1 2 0 3 4 3 4 1 2 3 3 2 3 1 0 3 4 1 3 4 0 0 3 2 0 2 1 0 3 0 0 1 2 2 4 0 1 3 4 3 1 2 0 2 1 1 2 2 0 0 1 0 4 1 4 2 3 4 3 3 3 3 4 1 3 1 4 3 2 0 3 2 0 1 1 0 1 4 2 4 2 0 2 3 3 3 2 0 1 1 2 0 0 2 2 0 4 4 3 3 2 0 1 0 0 2 4 1 1 0 1 1 0 3 2 </values> </instantiation>