| Name | Crossword/ Crossword-m18-ogd2008-vg-05-06_c18.xml |
| MD5SUM | 81d4059c2b76389bba6ef17dee6cb29a |
| 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.119659 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 11 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":30}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":30}] |
| Minimum constraint arity | 5 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":5,"count":6},{"arity":6,"count":5}] |
| Number of extensional constraints | 11 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":11}] |
| 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[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] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] </list> <values> 12 0 0 17 11 14 0 20 13 4 0 20 3 9 0 0 5 0 17 0 5 11 0 19 4 2 14 18 19 0 </values> </instantiation>