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