| Name | ChessboardColoration/ChessboardColoration-int-s1/ ChessboardColoration-int-40-40.xml |
| MD5SUM | 2ccb4f0641fb73c42fbac15220770a0a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 1600 |
| Number of constraints | 608401 |
| Number of domains | 1 |
| Minimum domain size | 1600 |
| Maximum domain size | 1600 |
| Distribution of domain sizes | [{"size":1600,"count":1600}] |
| Minimum variable degree | 1523 |
| Maximum variable degree | 1523 |
| Distribution of variable degrees | [{"degree":1523,"count":1600}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 1600 |
| Distribution of constraint arities | [{"arity":4,"count":608400},{"arity":1600,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 608400 |
| Distribution of constraint types | [{"type":"intension","count":608400},{"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: