| Name | Langford/ LangfordBin-11_c18.xml |
| MD5SUM | 0eb659d8c217bf688ca291acdf1662a5 |
| 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.4302 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 44 |
| Number of constraints | 33 |
| Number of domains | 2 |
| Minimum domain size | 11 |
| Maximum domain size | 22 |
| Distribution of domain sizes | [{"size":11,"count":22},{"size":22,"count":22}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 22 |
| Distribution of variable degrees | [{"degree":2,"count":22},{"degree":22,"count":22}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 23 |
| Distribution of constraint arities | [{"arity":2,"count":11},{"arity":23,"count":22}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 11 |
| Distribution of constraint types | [{"type":"intension","count":11},{"type":"element","count":22}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297664 | SAT | 1.4302 | 0.655081 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296929 | SAT | 3.47031 | 1.79589 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297165 | SAT | 3.48666 | 1.66777 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307113 | SAT | 4.63377 | 2.49809 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307349 | SAT | 4.69684 | 2.53206 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309020 | SAT | 4.84326 | 2.07744 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291251 | SAT | 5.4478 | 2.23321 |
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] v[16] v[17] v[18] v[19] v[20] v[21] 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] p[16] p[17] p[18] p[19] p[20] p[21] </list> <values>11 8 10 5 6 1 7 1 9 5 8 6 11 10 7 4 2 3 9 2 4 3 7 5 19 16 21 17 20 15 9 3 11 4 14 6 10 1 18 8 13 2 12 0 </values> </instantiation>