| 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 | 1.65554 |
| 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 |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297669 | SAT | 1.65554 | 0.684169 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296934 | SAT | 4.49329 | 1.90365 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297170 | SAT | 4.59362 | 1.9125 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309025 | SAT | 5.14258 | 2.67591 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307354 | SAT | 5.84225 | 2.76918 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307118 | SAT | 5.93367 | 2.78254 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291256 | SAT | 580.116 | 356.38 |
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] v[22] v[23] v[24] v[25] v[26] v[27] v[28] v[29] v[30] v[31] 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] p[22] p[23] p[24] p[25] p[26] p[27] p[28] p[29] p[30] p[31] </list> <values>8 2 5 6 2 1 14 1 5 8 6 11 13 15 16 9 10 12 3 4 7 14 3 11 4 9 13 10 7 15 12 16 7 5 4 1 22 18 24 19 8 2 10 3 28 20 9 0 25 15 27 16 23 11 30 17 26 12 21 6 29 13 31 14 </values> </instantiation>