| Name | Scheduling/Scheduling-os-taillard/ Taillard-os-07-07-6.xml |
| MD5SUM | c933cd09e9acfeb17baa8719fd3b3e7c |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 436 |
| Best CPU time to get the best result obtained on this benchmark | 251.933 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 203 |
| Number of constraints | 168 |
| Number of domains | 9 |
| Minimum domain size | 6 |
| Maximum domain size | 535 |
| Distribution of domain sizes | [{"size":6,"count":7},{"size":7,"count":91},{"size":535,"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: 436<instantiation type="solution"> <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 76 82 176 185 267 365 0 93 128 165 224 293 365 0 82 154 169 175 235 347 0 106 185 282 321 352 418 0 56 146 175 185 293 352 0 78 155 235 284 347 423 0 58 133 176 223 254 341 431 423 428 428 430 433 436 76 5 94 9 25 98 66 56 30 25 59 69 46 58 82 64 15 6 60 84 81 93 66 97 28 28 61 10 56 72 19 10 99 59 78 69 76 80 32 63 71 10 46 48 34 47 31 87 95 4 0 2 1 6 3 5 6 1 5 4 2 0 3 2 4 6 0 3 5 1 1 3 0 6 5 2 4 3 5 4 0 1 2 6 0 6 5 3 1 4 2 5 3 1 2 6 4 0 76 176 82 267 0 365 185 293 93 224 365 165 128 0 169 347 0 175 82 235 154 185 0 352 106 418 321 282 175 185 293 0 146 56 352 0 284 423 235 347 155 78 341 133 176 58 254 0 223 </values> </instantiation>