Name | BinPacking/BinPacking-mdd-sw120/ BinPacking-mdd-sw120-99.xml |
MD5SUM | 2ef74b22e25f9811269217f63e04e4c4 |
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.692 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 133 |
Number of constraints | 25 |
Number of domains | 2 |
Minimum domain size | 23 |
Maximum domain size | 50 |
Distribution of domain sizes | [{"size":23,"count":1},{"size":50,"count":132}] |
Minimum variable degree | 2 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":2,"count":1},{"degree":3,"count":110},{"degree":4,"count":22}] |
Minimum constraint arity | 6 |
Maximum constraint arity | 132 |
Distribution of constraint arities | [{"arity":6,"count":22},{"arity":23,"count":1},{"arity":132,"count":2}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"mdd","count":22},{"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 198 198 198 197 0 200 198 197 197 197 0 196 195 194 194 192 0 193 193 193 192 192 0 191 190 188 188 187 0 191 190 187 187 186 0 191 189 152 152 151 151 191 185 185 185 184 0 191 184 184 184 184 0 191 184 153 152 151 150 183 182 174 153 153 152 181 180 170 157 155 154 181 179 169 164 154 153 181 168 167 163 162 159 180 170 168 165 159 158 180 169 169 168 157 156 179 168 168 163 163 159 178 178 174 173 172 0 177 177 176 175 174 0 174 170 170 162 161 160 173 171 170 170 170 0 172 171 171 171 171 0 </values> </instantiation>