Name | BinPacking/BinPacking-tab-sw120/ BinPacking-tab-sw120-10.xml |
MD5SUM | 67f07639019614dd1d008c87f8253383 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT TO |
Best value of the objective obtained on this benchmark | 1 |
Best CPU time to get the best result obtained on this benchmark | 254.02699 |
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 | 22 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","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: 1<instantiation id='sol2' type='solution' cost='1'> <list> x b[][] </list> <values> 1 199 199 198 198 195 0 198 198 198 198 198 0 194 194 193 192 191 0 191 191 191 191 191 0 190 190 190 188 188 0 188 187 187 187 186 0 186 186 171 151 151 150 186 185 177 151 150 150 184 184 167 159 155 151 184 183 168 160 154 151 183 181 166 160 154 152 183 174 170 161 155 154 182 181 166 161 157 153 181 173 169 162 157 153 179 177 170 162 158 152 179 174 165 163 158 153 178 174 165 163 158 154 177 177 166 164 158 154 176 171 168 163 159 154 175 172 165 164 158 157 174 171 165 165 159 155 0 0 0 0 0 0 </values> </instantiation>