| Name | Langford/ LangfordBin-06_c18.xml |
| MD5SUM | 067c7c3f6995d0e6d34aa4db2f294f93 |
| 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.00947 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 24 |
| Number of constraints | 18 |
| Number of domains | 2 |
| Minimum domain size | 6 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":6,"count":12},{"size":12,"count":12}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 12 |
| Distribution of variable degrees | [{"degree":2,"count":12},{"degree":12,"count":12}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 13 |
| Distribution of constraint arities | [{"arity":2,"count":6},{"arity":13,"count":12}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 6 |
| Distribution of constraint types | [{"type":"intension","count":6},{"type":"element","count":12}] |
| 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: