| Name | Langford/ LangfordBin-12_c18.xml |
| MD5SUM | d44a6c2f310df02cbd65e302b0bb5238 |
| 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.4463 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 48 |
| Number of constraints | 36 |
| Number of domains | 2 |
| Minimum domain size | 12 |
| Maximum domain size | 24 |
| Distribution of domain sizes | [{"size":12,"count":24},{"size":24,"count":24}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 24 |
| Distribution of variable degrees | [{"degree":2,"count":24},{"degree":24,"count":24}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 25 |
| Distribution of constraint arities | [{"arity":2,"count":12},{"arity":25,"count":24}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 12 |
| Distribution of constraint types | [{"type":"intension","count":12},{"type":"element","count":24}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297665 | SAT | 1.4463 | 0.636544 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296930 | SAT | 3.61292 | 1.7262 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297166 | SAT | 3.66157 | 1.73061 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309021 | SAT | 4.70056 | 2.07963 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307114 | SAT | 4.78548 | 2.55975 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307350 | SAT | 4.8391 | 2.69056 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291252 | SAT | 5.45686 | 2.26188 |
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] 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] </list> <values>2 3 1 2 1 3 10 7 9 11 12 4 6 8 5 7 4 10 9 6 5 11 8 12 4 2 3 0 5 1 16 11 20 14 19 12 15 7 22 13 18 8 17 6 21 9 23 10 </values> </instantiation>