| Name | PseudoBoolean/PseudoBoolean-opt-bgr/ Pb-bgr-04.xml |
| MD5SUM | a565a7a5aa699043db8dfe2959276911 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 6 |
| Best CPU time to get the best result obtained on this benchmark | 0.013229 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 38 |
| Number of constraints | 44 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":38}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 30 |
| Distribution of variable degrees | [{"degree":2,"count":21},{"degree":29,"count":5},{"degree":30,"count":12}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 18 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":8,"count":2},{"arity":9,"count":7},{"arity":10,"count":6},{"arity":13,"count":6},{"arity":14,"count":18},{"arity":18,"count":4}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":44}] |
| 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: 6<instantiation type='solution' cost='6'> <list>x[0] x[10] x[11] x[12] x[13] x[14] x[15] x[16] x[17] x[18] x[19] x[1] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 0 0 0 0 1 0 0 1 1 1 0 1 1 1 1 1 1 1 0 1 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 </values> </instantiation>