| Name | Langford/Langford-m1-k3/ Langford-3-30.xml |
| MD5SUM | 104ead67a06ae27b0f069365e5914a8a |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 90 |
| Number of constraints | 61 |
| Number of domains | 1 |
| Minimum domain size | 90 |
| Maximum domain size | 90 |
| Distribution of domain sizes | [{"size":90,"count":90}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 3 |
| Distribution of variable degrees | [{"degree":2,"count":60},{"degree":3,"count":30}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 90 |
| Distribution of constraint arities | [{"arity":2,"count":60},{"arity":90,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 60 |
| Distribution of constraint types | [{"type":"intension","count":60},{"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: