Name | Scheduling/Scheduling-os-taillard/ Taillard-os-07-07-8.xml |
MD5SUM | 3801e67c429176a130b0cb7922d17a7f |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 458 |
Best CPU time to get the best result obtained on this benchmark | 29.0983 |
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: 458<instantiation> <list> e[] w[][] s[][] sd[][] d[][] </list> <values> 458 385 458 458 457 454 458 3 4 6 2 5 0 1 0 3 6 2 4 1 5 0 1 3 6 2 4 5 4 0 1 5 2 6 3 6 4 5 0 1 3 2 5 6 2 3 0 1 4 1 2 3 5 6 4 0 0 88 176 219 260 333 391 0 45 111 184 223 266 338 16 62 244 320 346 370 385 0 69 159 209 251 343 363 4 72 85 178 229 288 371 2 84 117 182 244 338 391 0 31 118 192 210 303 365 333 391 219 0 88 260 176 0 266 184 45 223 338 111 16 62 346 244 370 385 320 69 159 251 363 0 209 343 178 229 371 288 72 85 4 244 338 117 182 391 2 84 365 0 31 118 303 192 210 43 71 31 32 72 32 67 13 66 60 35 41 72 47 46 94 44 6 23 15 73 69 90 50 42 92 20 95 68 13 93 51 37 75 86 82 27 65 62 89 47 63 31 86 64 17 92 62 93 </values> </instantiation>