| Name | ChessboardColoration/ChessboardColoration-int-s2/ ChessboardColoration-int-08-10.xml |
| MD5SUM | 23e84b7c24701222a8a18862c478c748 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 18.5291 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 80 |
| Number of constraints | 1261 |
| Number of domains | 1 |
| Minimum domain size | 80 |
| Maximum domain size | 80 |
| Distribution of domain sizes | [{"size":80,"count":80}] |
| Minimum variable degree | 65 |
| Maximum variable degree | 65 |
| Distribution of variable degrees | [{"degree":65,"count":80}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 80 |
| Distribution of constraint arities | [{"arity":4,"count":1260},{"arity":80,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1260 |
| Distribution of constraint types | [{"type":"intension","count":1260},{"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: 2<instantiation id='sol6' type='solution' cost='2'> <list> x[][] </list> <values> 0 0 0 0 1 1 1 2 2 2 0 1 2 2 0 1 2 0 0 1 1 1 0 2 0 2 0 1 1 2 1 2 0 1 1 2 2 0 2 0 1 2 1 0 2 0 1 2 0 0 2 0 1 1 0 1 2 2 1 0 2 0 1 2 1 0 0 0 2 1 2 0 2 1 2 2 1 1 0 1 </values> </instantiation>