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