| Name | ChessboardColoration/ChessboardColoration-int-s2/ ChessboardColoration-int-09-11.xml |
| MD5SUM | 40f8709457985e2479c772f6dd1ec4a8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 3 |
| Best CPU time to get the best result obtained on this benchmark | 240.022 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 99 |
| Number of constraints | 1981 |
| Number of domains | 1 |
| Minimum domain size | 99 |
| Maximum domain size | 99 |
| Distribution of domain sizes | [{"size":99,"count":99}] |
| Minimum variable degree | 82 |
| Maximum variable degree | 82 |
| Distribution of variable degrees | [{"degree":82,"count":99}] |
| Minimum constraint arity | 4 |
| Maximum constraint arity | 99 |
| Distribution of constraint arities | [{"arity":4,"count":1980},{"arity":99,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 1980 |
| Distribution of constraint types | [{"type":"intension","count":1980},{"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 type='solution' cost='3'> <list>x[0][0] x[0][10] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[1][0] x[1][10] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[2][0] x[2][10] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[3][0] x[3][10] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9] x[4][0] x[4][10] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[4][9] x[5][0] x[5][10] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[5][9] x[6][0] x[6][10] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[6][9] x[7][0] x[7][10] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[7][9] x[8][0] x[8][10] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] x[8][9] </list> <values>0 3 0 0 0 1 1 2 3 3 3 0 3 2 2 3 0 2 2 0 1 2 1 0 0 1 1 0 1 0 1 0 1 1 2 1 2 0 1 0 1 0 0 0 2 1 2 3 2 0 0 1 2 1 1 3 2 1 0 2 0 1 2 3 1 0 3 1 1 0 2 2 0 0 1 3 2 3 2 1 3 1 3 3 0 0 2 2 3 0 2 0 3 2 1 1 0 2 3 </values> </instantiation>