| Name | ColouredQueens/ ColouredQueens-07_c18.xml |
| MD5SUM | 968c6e40c1de71b17fca4670fe54f327 |
| 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 | 0.007257 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 49 |
| Number of constraints | 36 |
| Number of domains | 1 |
| Minimum domain size | 7 |
| Maximum domain size | 7 |
| Distribution of domain sizes | [{"size":7,"count":49}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":3,"count":4},{"degree":4,"count":45}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":4},{"arity":4,"count":4},{"arity":5,"count":4},{"arity":6,"count":4},{"arity":7,"count":16}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"allDifferent","count":36}] |
| 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[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] </list> <values> 5 0 1 4 6 2 3 1 4 6 2 3 5 0 6 2 3 5 0 1 4 3 5 0 1 4 6 2 0 1 4 6 2 3 5 4 6 2 3 5 0 1 2 3 5 0 1 4 6 </values> </instantiation>