| Name | BinPacking/BinPacking-sum-skj1/ BinPacking-sum-n1c1w4k.xml |
| MD5SUM | bade4ae5f74057612f70883ad9768226 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 3 |
| Best CPU time to get the best result obtained on this benchmark | 6.15173 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 89 |
| Number of constraints | 91 |
| Number of domains | 2 |
| Minimum domain size | 39 |
| Maximum domain size | 45 |
| Distribution of domain sizes | [{"size":39,"count":88},{"size":45,"count":1}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":44},{"degree":5,"count":44}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 88 |
| Distribution of constraint arities | [{"arity":2,"count":88},{"arity":45,"count":1},{"arity":88,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"ordered","count":44},{"type":"lex","count":1},{"type":"sum","count":44},{"type":"count","count":1},{"type":"cardinality","count":1}] |
| Optimization problem | YES |
| Type of objective | max VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 3<instantiation id='sol3' type='solution' cost='3'> <list> x b[][] </list> <values> 3 100 0 98 0 95 0 94 0 94 0 94 0 93 0 92 0 87 0 85 0 85 0 84 0 83 0 82 0 81 0 78 0 78 0 75 0 73 0 72 0 71 0 71 0 70 0 70 0 68 0 67 0 67 0 66 0 65 0 64 0 60 37 59 36 58 0 57 43 56 43 56 35 56 0 55 45 55 43 54 46 51 49 0 0 0 0 0 0 </values> </instantiation>