| Name | PseudoBoolean-opt/ Pb-garden-4x4_c18.xml |
| MD5SUM | 854371ae6c45321a117efbc84c9832b3 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 4 |
| Best CPU time to get the best result obtained on this benchmark | 0.00617 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 16 |
| Number of constraints | 16 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":16}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":4,"count":4},{"degree":5,"count":8},{"degree":6,"count":4}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":3,"count":4},{"arity":4,"count":8},{"arity":5,"count":4}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":16}] |
| 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: 4<instantiation type="optimum" cost="4"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] </list> <values> 0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0 </values> </instantiation>