| Name | ChessboardColoration/ChessboardColoration-int-s2/ ChessboardColoration-int-11-13.xml |
| MD5SUM | b332b46b2d271d96c2352c0c61c10556 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 3 |
| Best CPU time to get the best result obtained on this benchmark | 84.6157 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 143 |
| Number of constraints | 4291 |
| Number of domains | 1 |
| Minimum domain size | 143 |
| Maximum domain size | 143 |
| Distribution of domain sizes | [{"size":143,"count":143}] |
| Minimum variable degree | 122 |
| Maximum variable degree | 122 |
| Distribution of variable degrees | [{"degree":122,"count":143}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 143 |
| Distribution of constraint arities | [{"arity":4,"count":4290},{"arity":143,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 4290 |
| Distribution of constraint types | [{"type":"intension","count":4290},{"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> <list> x[][] </list> <values> 0 0 0 1 1 2 2 2 2 2 2 3 3 0 1 2 2 3 0 1 1 1 1 2 0 1 0 3 2 0 2 1 0 2 3 3 1 3 1 1 0 1 3 0 3 2 0 1 3 1 0 3 1 0 3 1 3 1 0 1 0 3 2 2 0 1 2 0 3 2 0 3 3 2 1 3 1 0 2 0 2 0 3 0 2 1 3 0 3 1 2 2 1 3 1 2 2 3 0 3 0 1 2 0 2 2 3 2 1 1 0 3 1 2 0 0 3 3 1 1 2 3 1 3 2 0 0 0 3 2 3 2 0 1 0 3 0 3 1 0 2 1 2 </values> </instantiation>