| Name | Langford/ LangfordBin-10_c18.xml |
| MD5SUM | 2feb3ccfa512a42ac39c3fc722de9112 |
| 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 | 3.88722 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 30 |
| Number of domains | 2 |
| Minimum domain size | 10 |
| Maximum domain size | 20 |
| Distribution of domain sizes | [{"size":10,"count":20},{"size":20,"count":20}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 20 |
| Distribution of variable degrees | [{"degree":2,"count":20},{"degree":20,"count":20}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":2,"count":10},{"arity":21,"count":20}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 10 |
| Distribution of constraint types | [{"type":"intension","count":10},{"type":"element","count":20}] |
| 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: