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