| Name | Langford/Langford-m1-k3/ Langford-3-14.xml |
| MD5SUM | be7a6961e736c78e558242a96ea5fa7b |
| 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 | 45.3998 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 42 |
| Number of constraints | 29 |
| Number of domains | 1 |
| Minimum domain size | 42 |
| Maximum domain size | 42 |
| Distribution of domain sizes | [{"size":42,"count":42}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":28},{"degree":3,"count":14}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 42 |
| Distribution of constraint arities | [{"arity":2,"count":28},{"arity":42,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 28 |
| Distribution of constraint types | [{"type":"intension","count":28},{"type":"allDifferent","count":1}] |
| 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: