| Name | PseudoBoolean-opt/ Pb-garden-100x100_c18.xml |
| MD5SUM | e5dfb30e0194585ed3b6739089de139d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 2675 |
| Best CPU time to get the best result obtained on this benchmark | 2519.94 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 10000 |
| Number of constraints | 10000 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":10000}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":4,"count":4},{"degree":5,"count":392},{"degree":6,"count":9604}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":3,"count":4},{"arity":4,"count":392},{"arity":5,"count":9604}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":10000}] |
| 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: 2675--too large--