| Name | PseudoBoolean/PseudoBoolean-opt-marketSplit/ Pb-msplit-opt-4-30-3.xml |
| MD5SUM | caf7afe645c801dd46bb53c517bf0cee |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 142.375 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 94 |
| Number of constraints | 8 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":94}] |
| Minimum variable degree | 3 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":3,"count":64},{"degree":6,"count":1},{"degree":8,"count":29}] |
| Minimum constraint arity | 45 |
| Maximum constraint arity | 46 |
| Distribution of constraint arities | [{"arity":45,"count":2},{"arity":46,"count":6}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":8}] |
| 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: 2<instantiation id='sol26' type='solution' cost='2'> <list> x[] </list> <values> 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 1 1 0 1 0 1 1 1 1 1 0 0 0 0 0 0 1 1 0 1 0 0 1 </values> </instantiation>