| Name | PseudoBoolean/PseudoBoolean-opt-marketSplit/ Pb-msplit-opt-4-30-1.xml |
| MD5SUM | 0b293698762add7ba6ae5db7003c937f |
| 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 | 858.942 |
| 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":2},{"degree":8,"count":28}] |
| Minimum constraint arity | 45 |
| Maximum constraint arity | 46 |
| Distribution of constraint arities | [{"arity":45,"count":4},{"arity":46,"count":4}] |
| 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 |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 2 (complete) | 4394783 | OPT | 2 | 858.942 | 859.013 |
| cosoco 2.0 (complete) | 4408810 | OPT | 2 | 860.212 | 860.245 |
| cosoco 2.0 (complete) | 4397550 | OPT | 2 | 860.587 | 860.658 |
| (reference) PicatSAT 2019-09-12 (complete) | 4407787 | OPT | 2 | 1248.49 | 1248.63 |
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 type='solution' cost='2'> <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[38] x[39] x[3] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[4] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[5] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[6] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[7] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[8] x[90] x[91] x[92] x[93] x[9] </list> <values>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 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 0 0 1 0 1 0 0 1 0 0 0 1 1 0 1 0 1 0 0 0 0 1 0 1 1 0 1 0 0 1 0 0 1 0 1 0 </values> </instantiation>