| Name | Langford/ LangfordBin-07_c18.xml |
| MD5SUM | 3bc0c2fe6daffe5cd6c78f401afaf84f |
| 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.24067 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 28 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 7 |
| Maximum domain size | 14 |
| Distribution of domain sizes | [{"size":7,"count":14},{"size":14,"count":14}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":2,"count":14},{"degree":14,"count":14}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 15 |
| Distribution of constraint arities | [{"arity":2,"count":7},{"arity":15,"count":14}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 7 |
| Distribution of constraint types | [{"type":"intension","count":7},{"type":"element","count":14}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297660 | SAT | 1.24067 | 0.679798 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296925 | SAT | 2.76757 | 1.49607 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297161 | SAT | 2.79983 | 1.51416 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307345 | SAT | 3.92956 | 2.31103 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307109 | SAT | 3.99377 | 2.34701 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291247 | SAT | 4.02315 | 1.90922 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309016 | SAT | 4.07825 | 1.82035 |
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] 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] </list> <values>1 4 1 5 6 7 4 2 3 5 2 6 3 7 2 0 10 7 12 8 6 1 9 3 11 4 13 5 </values> </instantiation>