| Name | Langford/ LangfordBin-16_c18.xml |
| MD5SUM | 27c67f30ca0ef1b1bbbeaa4cb2c2f178 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.261181 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 48 |
| Number of domains | 2 |
| Minimum domain size | 16 |
| Maximum domain size | 32 |
| Distribution of domain sizes | [{"size":16,"count":32},{"size":32,"count":32}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 32 |
| Distribution of variable degrees | [{"degree":2,"count":32},{"degree":32,"count":32}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 33 |
| Distribution of constraint arities | [{"arity":2,"count":16},{"arity":33,"count":32}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 16 |
| Distribution of constraint types | [{"type":"intension","count":16},{"type":"element","count":32}] |
| 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:<instantiation> <list> v[] p[] </list> <values> 4 13 6 12 15 4 7 11 3 6 14 9 3 16 7 13 12 5 10 11 15 9 8 5 2 14 1 2 1 10 16 8 28 26 27 24 12 8 5 0 23 17 9 2 14 6 31 22 21 11 29 18 19 7 16 3 15 1 25 10 20 4 30 13 </values> </instantiation>