| Name | BinPacking/BinPacking-sum-skj1/ BinPacking-sum-n1c1w4m.xml |
| MD5SUM | 9af4c2349f4dbdb842cc927ab12812f8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 6.11337 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 130 |
| Number of constraints | 89 |
| Number of domains | 2 |
| Minimum domain size | 35 |
| Maximum domain size | 44 |
| Distribution of domain sizes | [{"size":35,"count":129},{"size":44,"count":1}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":86},{"degree":5,"count":43}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 129 |
| Distribution of constraint arities | [{"arity":3,"count":86},{"arity":44,"count":1},{"arity":129,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"ordered","count":43},{"type":"lex","count":1},{"type":"sum","count":43},{"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: 2<instantiation id='sol2' type='solution' cost='2'> <list> x b[][] </list> <values> 2 100 0 0 99 0 0 99 0 0 94 0 0 93 0 0 92 0 0 91 0 0 89 0 0 88 0 0 88 0 0 87 0 0 80 0 0 79 0 0 77 0 0 75 0 0 74 0 0 73 0 0 71 0 0 71 0 0 71 0 0 69 0 0 66 0 0 64 34 0 64 0 0 64 0 0 63 33 0 63 0 0 63 0 0 62 0 0 60 0 0 60 0 0 59 31 0 59 0 0 59 0 0 55 42 0 55 42 0 55 0 0 53 45 0 51 49 0 49 46 0 48 46 0 0 0 0 0 0 0 </values> </instantiation>