| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-07-07-5.xml |
| MD5SUM | e703a022bfe4f723b0880c2305d40b57 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 460 |
| Best CPU time to get the best result obtained on this benchmark | 248.88901 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 203 |
| Number of constraints | 168 |
| Number of domains | 9 |
| Minimum domain size | 6 |
| Maximum domain size | 560 |
| Distribution of domain sizes | [{"size":6,"count":7},{"size":7,"count":91},{"size":560,"count":105}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":2,"count":56},{"degree":3,"count":98},{"degree":8,"count":49}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":1,"count":7},{"arity":2,"count":49},{"arity":3,"count":49},{"arity":7,"count":14},{"arity":9,"count":49}] |
| Number of extensional constraints | 49 |
| Number of intensional constraints | 56 |
| Distribution of constraint types | [{"type":"extension","count":49},{"type":"intension","count":56},{"type":"allDifferent","count":7},{"type":"noOverlap","count":7},{"type":"element","count":49}] |
| 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: 460<instantiation> <list>s[0][0] s[0][1] s[0][2] s[0][3] s[0][4] s[0][5] s[0][6] s[1][0] s[1][1] s[1][2] s[1][3] s[1][4] s[1][5] s[1][6] s[2][0] s[2][1] s[2][2] s[2][3] s[2][4] s[2][5] s[2][6] s[3][0] s[3][1] s[3][2] s[3][3] s[3][4] s[3][5] s[3][6] s[4][0] s[4][1] s[4][2] s[4][3] s[4][4] s[4][5] s[4][6] s[5][0] s[5][1] s[5][2] s[5][3] s[5][4] s[5][5] s[5][6] s[6][0] s[6][1] s[6][2] s[6][3] s[6][4] s[6][5] s[6][6] e[0] e[1] e[2] e[3] e[4] e[5] e[6] d[0][0] d[0][1] d[0][2] d[0][3] d[0][4] d[0][5] d[0][6] d[1][0] d[1][1] d[1][2] d[1][3] d[1][4] d[1][5] d[1][6] d[2][0] d[2][1] d[2][2] d[2][3] d[2][4] d[2][5] d[2][6] d[3][0] d[3][1] d[3][2] d[3][3] d[3][4] d[3][5] d[3][6] d[4][0] d[4][1] d[4][2] d[4][3] d[4][4] d[4][5] d[4][6] d[5][0] d[5][1] d[5][2] d[5][3] d[5][4] d[5][5] d[5][6] d[6][0] d[6][1] d[6][2] d[6][3] d[6][4] d[6][5] d[6][6] w[0][0] w[0][1] w[0][2] w[0][3] w[0][4] w[0][5] w[0][6] w[1][0] w[1][1] w[1][2] w[1][3] w[1][4] w[1][5] w[1][6] w[2][0] w[2][1] w[2][2] w[2][3] w[2][4] w[2][5] w[2][6] w[3][0] w[3][1] w[3][2] w[3][3] w[3][4] w[3][5] w[3][6] w[4][0] w[4][1] w[4][2] w[4][3] w[4][4] w[4][5] w[4][6] w[5][0] w[5][1] w[5][2] w[5][3] w[5][4] w[5][5] w[5][6] w[6][0] w[6][1] w[6][2] w[6][3] w[6][4] w[6][5] w[6][6] sd[0][0] sd[0][1] sd[0][2] sd[0][3] sd[0][4] sd[0][5] sd[0][6] sd[1][0] sd[1][1] sd[1][2] sd[1][3] sd[1][4] sd[1][5] sd[1][6] sd[2][0] sd[2][1] sd[2][2] sd[2][3] sd[2][4] sd[2][5] sd[2][6] sd[3][0] sd[3][1] sd[3][2] sd[3][3] sd[3][4] sd[3][5] sd[3][6] sd[4][0] sd[4][1] sd[4][2] sd[4][3] sd[4][4] sd[4][5] sd[4][6] sd[5][0] sd[5][1] sd[5][2] sd[5][3] sd[5][4] sd[5][5] sd[5][6] sd[6][0] sd[6][1] sd[6][2] sd[6][3] sd[6][4] sd[6][5] sd[6][6] </list> <values>0 95 97 173 283 338 426 0 95 181 221 306 338 395 0 97 164 240 301 302 365 0 94 183 221 287 347 386 0 122 183 207 215 301 347 0 97 173 240 260 306 395 0 94 169 207 287 336 365 446 454 440 447 353 455 460 95 2 76 87 55 88 20 95 69 40 78 32 57 59 87 25 76 61 1 63 75 94 89 25 66 41 39 61 91 59 24 8 77 46 6 97 60 64 5 46 80 60 93 75 36 76 49 27 95 2 3 1 0 4 6 5 3 5 6 2 0 4 1 4 6 5 1 2 3 0 0 4 3 6 5 1 2 5 6 4 2 3 1 0 6 3 1 5 0 2 4 1 0 2 4 6 5 3 173 97 0 95 283 426 338 306 395 221 0 338 95 181 365 240 301 302 0 164 97 0 347 386 183 94 287 221 347 301 207 215 183 0 122 260 173 306 97 395 240 0 94 0 169 365 207 336 287 </values> </instantiation>