Name | BinPacking/BinPacking-mdd-sw120/ BinPacking-mdd-sw120-20.xml |
MD5SUM | 60ebd5c4fe4cf6d5772447ebf177dfde |
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.761 |
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 199 187 187 184 0 200 198 187 184 184 0 199 195 195 195 194 0 198 198 198 196 196 0 198 193 185 185 185 0 198 193 184 184 184 0 195 190 190 189 189 0 194 192 191 191 191 0 193 193 186 186 185 0 193 192 189 188 187 0 184 184 183 183 183 0 182 181 180 180 180 0 180 180 179 155 153 152 179 179 178 157 154 151 178 177 177 157 155 153 177 176 175 157 157 156 175 174 174 163 157 151 173 173 172 163 160 158 172 170 170 163 161 160 171 166 165 164 162 160 170 169 169 163 161 160 169 168 167 166 160 159 </values> </instantiation>