| Name | PseudoBoolean/ PseudoBoolean-opt-gr/Pb-gr-05.xml |
| MD5SUM | e9813c111db0babccd5c24a1dd850827 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 11 |
| Best CPU time to get the best result obtained on this benchmark | 0.0948 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 75 |
| Number of constraints | 104 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":75}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 62 |
| Distribution of variable degrees | [{"degree":2,"count":50},{"degree":61,"count":5},{"degree":62,"count":20}] |
| Minimum constraint arity | 10 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":10,"count":4},{"arity":11,"count":20},{"arity":16,"count":60},{"arity":21,"count":20}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":104}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253425 | OPT | 11 | 0.0948 | 0.0957389 |
| cosoco-mini 1.12 (complete) | 4267154 | OPT | 11 | 0.096377999 | 0.16159 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259973 | OPT | 11 | 0.096725002 | 0.192094 |
| Naxos 1.1.0 (complete) | 4253426 | OPT | 11 | 0.747937 | 0.748251 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 11<instantiation type='solution' cost='11'> <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] x[16] x[17] x[18] x[19] x[20] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[70] x[71] x[72] x[73] x[74] </list> <values>1 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 1 0 0 1 1 0 0 0 0 </values> </instantiation>