| Name | Sudoku/ Sudoku-table-s1/Sudoku-s10c-table.xml |
| MD5SUM | 8248e4e11a775a898590caffd4c1e549 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 3.54494 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 81 |
| Number of constraints | 28 |
| Number of domains | 1 |
| Minimum domain size | 9 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":9,"count":81}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":49},{"degree":4,"count":32}] |
| Minimum constraint arity | 9 |
| Maximum constraint arity | 32 |
| Distribution of constraint arities | [{"arity":9,"count":27},{"arity":32,"count":1}] |
| Number of extensional constraints | 27 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":27},{"type":"instantiation","count":1}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type="solution"> <list> x[0][0] 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[1][0] 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[2][0] 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[3][0] 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[4][0] 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[5][0] 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[6][0] 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[7][0] 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[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] </list> <values> 1 9 3 6 7 2 4 8 5 4 6 2 3 5 8 9 7 1 7 8 5 9 1 4 6 2 3 5 3 8 2 9 6 7 1 4 6 7 4 1 3 5 2 9 8 2 1 9 4 8 7 3 5 6 8 2 6 7 4 1 5 3 9 9 4 1 5 2 3 8 6 7 3 5 7 8 6 9 1 4 2 </values> </instantiation>