| Name | BinPacking/BinPacking-sum-skj1/ BinPacking-sum-n1c1w4n.xml |
| MD5SUM | ff46b38b3e2da44b02be81a37c246a0d |
| 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 | 8.21217 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 127 |
| Number of constraints | 87 |
| Number of domains | 2 |
| Minimum domain size | 40 |
| Maximum domain size | 43 |
| Distribution of domain sizes | [{"size":40,"count":126},{"size":43,"count":1}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":84},{"degree":5,"count":42}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 126 |
| Distribution of constraint arities | [{"arity":3,"count":84},{"arity":43,"count":1},{"arity":126,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"ordered","count":42},{"type":"lex","count":1},{"type":"sum","count":42},{"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='sol4' type='solution' cost='3'> <list> x b[][] </list> <values> 3 99 0 0 97 0 0 97 0 0 96 0 0 96 0 0 95 0 0 94 0 0 93 0 0 92 0 0 90 0 0 86 0 0 85 0 0 85 0 0 84 0 0 82 0 0 82 0 0 82 0 0 80 0 0 79 0 0 75 0 0 73 0 0 72 0 0 72 0 0 71 0 0 70 0 0 69 31 0 69 31 0 68 32 0 68 0 0 66 31 0 65 34 0 63 0 0 61 36 0 60 39 0 57 41 0 55 0 0 53 47 0 49 41 0 48 44 0 0 0 0 0 0 0 0 0 0 </values> </instantiation>