| Name | Langford/ LangfordBin-15_c18.xml |
| MD5SUM | 07ea5144b09b59ff4e6e73933349a8c8 |
| 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 | 0.017778 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 45 |
| Number of domains | 2 |
| Minimum domain size | 15 |
| Maximum domain size | 30 |
| Distribution of domain sizes | [{"size":15,"count":30},{"size":30,"count":30}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 30 |
| Distribution of variable degrees | [{"degree":2,"count":30},{"degree":30,"count":30}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 31 |
| Distribution of constraint arities | [{"arity":2,"count":15},{"arity":31,"count":30}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 15 |
| Distribution of constraint types | [{"type":"intension","count":15},{"type":"element","count":30}] |
| Optimization problem | NO |
| Type of objective |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation type='solution'> <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] 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] </list> <values>15 12 14 11 8 6 3 13 9 10 3 7 6 8 12 11 15 14 9 7 10 13 5 2 4 1 2 1 5 4 27 25 26 23 10 6 29 24 28 22 12 5 19 11 13 4 18 8 20 9 15 3 14 1 21 7 17 2 16 0 </values> </instantiation>