| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-05-05-9.xml |
| MD5SUM | b1b903d633c720775ef1eb29649a113f |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 326 |
| Best CPU time to get the best result obtained on this benchmark | 71.385803 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 105 |
| Number of constraints | 90 |
| Number of domains | 7 |
| Minimum domain size | 5 |
| Maximum domain size | 426 |
| Distribution of domain sizes | [{"size":5,"count":50},{"size":426,"count":55}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":2,"count":30},{"degree":3,"count":50},{"degree":6,"count":25}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 7 |
| Distribution of constraint arities | [{"arity":1,"count":5},{"arity":2,"count":25},{"arity":3,"count":25},{"arity":5,"count":10},{"arity":7,"count":25}] |
| Number of extensional constraints | 25 |
| Number of intensional constraints | 30 |
| Distribution of constraint types | [{"type":"extension","count":25},{"type":"intension","count":30},{"type":"allDifferent","count":5},{"type":"noOverlap","count":5},{"type":"element","count":25}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 326<instantiation> <list> s[0][0] s[0][1] s[0][2] s[0][3] s[0][4] s[1][0] s[1][1] s[1][2] s[1][3] s[1][4] s[2][0] s[2][1] s[2][2] s[2][3] s[2][4] s[3][0] s[3][1] s[3][2] s[3][3] s[3][4] s[4][0] s[4][1] s[4][2] s[4][3] s[4][4] e[0] e[1] e[2] e[3] e[4] d[0][0] d[0][1] d[0][2] d[0][3] d[0][4] d[1][0] d[1][1] d[1][2] d[1][3] d[1][4] d[2][0] d[2][1] d[2][2] d[2][3] d[2][4] d[3][0] d[3][1] d[3][2] d[3][3] d[3][4] d[4][0] d[4][1] d[4][2] d[4][3] d[4][4] w[0][0] w[0][1] w[0][2] w[0][3] w[0][4] w[1][0] w[1][1] w[1][2] w[1][3] w[1][4] w[2][0] w[2][1] w[2][2] w[2][3] w[2][4] w[3][0] w[3][1] w[3][2] w[3][3] w[3][4] w[4][0] w[4][1] w[4][2] w[4][3] w[4][4] sd[0][0] sd[0][1] sd[0][2] sd[0][3] sd[0][4] sd[1][0] sd[1][1] sd[1][2] sd[1][3] sd[1][4] sd[2][0] sd[2][1] sd[2][2] sd[2][3] sd[2][4] sd[3][0] sd[3][1] sd[3][2] sd[3][3] sd[3][4] sd[4][0] sd[4][1] sd[4][2] sd[4][3] sd[4][4] </list> <values> 15 119 210 231 290 1 26 128 195 227 5 65 105 184 281 0 49 134 164 231 1 54 130 206 235 326 326 326 281 326 90 87 17 59 36 14 93 56 32 99 44 40 59 97 45 49 81 30 67 50 53 74 76 25 91 0 2 3 4 1 0 2 1 4 3 3 4 0 1 2 1 3 4 0 2 4 1 3 2 0 15 290 119 210 231 1 128 26 227 195 105 184 281 5 65 164 0 231 49 134 235 54 206 130 1 </values> </instantiation>