Name | BinPacking/BinPacking-sum-skj2/ BinPacking-sum-n1w4b1r5.xml |
MD5SUM | d746abd17fd9f5e52f47be3617d955ae |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 5.17688 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 51 |
Number of constraints | 13 |
Number of domains | 2 |
Minimum domain size | 6 |
Maximum domain size | 35 |
Distribution of domain sizes | [{"size":6,"count":1},{"size":35,"count":50}] |
Minimum variable degree | 2 |
Maximum variable degree | 5 |
Distribution of variable degrees | [{"degree":2,"count":1},{"degree":4,"count":45},{"degree":5,"count":5}] |
Minimum constraint arity | 6 |
Maximum constraint arity | 50 |
Distribution of constraint arities | [{"arity":6,"count":1},{"arity":10,"count":10},{"arity":50,"count":2}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"ordered","count":5},{"type":"lex","count":1},{"type":"sum","count":5},{"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: