| Name | BinPacking/ BinPacking-sum-ft/BinPacking-sum-ft060-11.xml |
| MD5SUM | 684901dbc993846247574678cc891221 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 242.52299 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 70 |
| Number of constraints | 49 |
| Number of domains | 2 |
| Minimum domain size | 24 |
| Maximum domain size | 47 |
| Distribution of domain sizes | [{"size":24,"count":1},{"size":47,"count":69}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 5 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":46},{"degree":5,"count":23}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 69 |
| Distribution of constraint arities | [{"arity":3,"count":46},{"arity":24,"count":1},{"arity":69,"count":2}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"ordered","count":23},{"type":"lex","count":1},{"type":"sum","count":23},{"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: 2<instantiation id='sol3' type='solution' cost='2'> <list> x b[][] </list> <values> 2 495 493 0 492 492 0 481 253 253 470 253 253 450 256 255 447 257 256 409 251 251 399 266 258 398 252 252 396 284 266 395 268 267 392 270 268 391 278 278 389 283 280 385 307 296 381 323 295 378 331 288 372 336 284 370 369 0 352 331 313 352 327 313 0 0 0 0 0 0 </values> </instantiation>