| Name | Langford/ LangfordBin-08_c18.xml |
| MD5SUM | 6540e056641e8d5f1a9996bec92d89db |
| 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 | 1.31176 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 32 |
| Number of constraints | 24 |
| Number of domains | 2 |
| Minimum domain size | 8 |
| Maximum domain size | 16 |
| Distribution of domain sizes | [{"size":8,"count":16},{"size":16,"count":16}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 16 |
| Distribution of variable degrees | [{"degree":2,"count":16},{"degree":16,"count":16}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 17 |
| Distribution of constraint arities | [{"arity":2,"count":8},{"arity":17,"count":16}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 8 |
| Distribution of constraint types | [{"type":"intension","count":8},{"type":"element","count":16}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297661 | SAT | 1.31176 | 0.613861 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297162 | SAT | 2.8639 | 1.53244 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296926 | SAT | 2.94228 | 1.54628 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307110 | SAT | 4.1192 | 2.37503 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307346 | SAT | 4.13892 | 2.36653 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309017 | SAT | 5.63022 | 2.15281 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291248 | SAT | 5.76816 | 2.22086 |
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[0] v[1] v[2] v[3] v[4] v[5] v[6] v[7] v[8] v[9] v[10] v[11] v[12] v[13] v[14] v[15] p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] p[9] p[10] p[11] p[12] p[13] p[14] p[15] </list> <values>8 2 7 3 2 6 4 3 5 8 7 4 6 1 5 1 15 13 4 1 7 3 11 6 14 8 12 5 10 2 9 0 </values> </instantiation>