| Name | Crossword/ Crossword-m1c-ogd-vg/Crossword-m1c-ogd-vg-15-19.xml |
| MD5SUM | 771a2032fa08b3551aec0b6adeb94e67 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.204409 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 285 |
| Number of constraints | 34 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":285}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":285}] |
| Minimum constraint arity | 15 |
| Maximum constraint arity | 19 |
| Distribution of constraint arities | [{"arity":15,"count":19},{"arity":19,"count":15}] |
| Number of extensional constraints | 34 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":34}] |
| 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: