| Name | Crossword/ Crossword-m1c-uk-vg/Crossword-m1c-uk-vg-10-13.xml |
| MD5SUM | b2328828c3d6779cf7f2f3294a289055 |
| 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 | 183.225 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 130 |
| Number of constraints | 23 |
| Number of domains | 1 |
| Minimum domain size | 26 |
| Maximum domain size | 26 |
| Distribution of domain sizes | [{"size":26,"count":130}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 2 |
| Distribution of variable degrees | [{"degree":2,"count":130}] |
| Minimum constraint arity | 10 |
| Maximum constraint arity | 13 |
| Distribution of constraint arities | [{"arity":10,"count":13},{"arity":13,"count":10}] |
| Number of extensional constraints | 23 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":23}] |
| 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: