| Name | PseudoBoolean/PseudoBoolean-opt-marketSplit/ Pb-msplit-4-30-2.xml |
| MD5SUM | 81d0b6dc5f2e6c238bfcda5bddd020dd |
| 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 | 27.7653 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 31 |
| Number of constraints | 9 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":31}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":2,"count":1},{"degree":6,"count":3},{"degree":8,"count":27}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":28,"count":2},{"arity":29,"count":2},{"arity":30,"count":4}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":9}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: