| Name | BinPacking/BinPacking-mdd-sw100/ BinPacking-mdd-sw100-63.xml |
| MD5SUM | c5b43cb4096baa2a106332b7cfda903c |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 0 |
| Best CPU time to get the best result obtained on this benchmark | 245.26601 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 109 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 19 |
| Maximum domain size | 46 |
| Distribution of domain sizes | [{"size":19,"count":1},{"size":46,"count":108}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 4 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":90},{"degree":4,"count":18}] |
| Minimum constraint arity | 6 |
| Maximum constraint arity | 108 |
| Distribution of constraint arities | [{"arity":6,"count":18},{"arity":19,"count":1},{"arity":108,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"mdd","count":18},{"type":"lex","count":1},{"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: 0<instantiation id='sol1' type='solution' cost='0'> <list> x b[][] </list> <values> 0 200 200 200 200 200 0 199 198 197 195 188 0 198 191 190 189 189 0 196 195 193 192 191 0 188 188 187 187 186 0 186 186 186 186 186 0 185 184 184 183 183 0 183 182 181 180 180 0 179 178 177 154 151 150 177 177 177 160 152 150 176 176 176 155 152 152 175 174 172 164 160 154 174 174 168 161 161 152 173 173 173 165 161 155 171 169 165 164 160 160 168 168 167 164 159 157 166 166 166 164 163 155 166 166 166 164 160 159 </values> </instantiation>