Name | BinPacking/BinPacking-mdd-sw120/ BinPacking-mdd-sw120-63.xml |
MD5SUM | 6886ed4ce8536fa7eb6fe38004cd2981 |
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 | 246.065 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 133 |
Number of constraints | 25 |
Number of domains | 2 |
Minimum domain size | 23 |
Maximum domain size | 46 |
Distribution of domain sizes | [{"size":23,"count":1},{"size":46,"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 197 197 196 196 0 199 199 193 193 193 0 199 198 197 193 192 0 199 196 194 193 192 0 192 192 191 191 190 0 190 190 190 190 189 0 189 189 188 187 186 0 186 186 185 184 184 0 184 183 182 181 181 0 180 180 180 179 176 0 176 176 176 174 174 0 174 173 173 173 172 0 172 171 171 168 167 151 170 170 170 170 170 150 170 170 169 169 169 153 168 168 168 168 167 153 166 166 166 166 166 165 165 165 164 164 164 164 162 161 161 160 159 159 158 158 157 157 157 157 157 156 156 156 156 155 155 154 154 154 154 154 </values> </instantiation>