| Name | BinPacking/BinPacking-mdd-sw100/ BinPacking-mdd-sw100-75.xml |
| MD5SUM | d512fd03759c8e886ee5b37275b97c5f |
| 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 | 244.743 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 109 |
| Number of constraints | 21 |
| Number of domains | 2 |
| Minimum domain size | 19 |
| Maximum domain size | 45 |
| Distribution of domain sizes | [{"size":19,"count":1},{"size":45,"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 199 199 199 0 199 198 198 198 195 0 196 196 194 193 193 0 193 193 193 193 192 0 192 192 190 189 189 0 189 188 185 185 185 0 184 184 184 184 182 0 183 183 183 181 181 0 180 180 180 151 151 150 179 178 172 160 157 152 178 178 171 160 157 155 177 177 177 158 158 153 176 174 167 164 163 155 176 171 168 164 162 159 176 171 167 164 163 158 176 169 166 165 162 156 176 168 166 165 162 155 175 175 167 165 161 155 </values> </instantiation>