Name | PseudoBoolean/PseudoBoolean-opt-bgr/ Pb-bgr-06.xml |
MD5SUM | 13781919ebaa3dfa405a2e3a2e4eb30e |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 17 |
Best CPU time to get the best result obtained on this benchmark | 0.293746 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 139 |
Number of constraints | 216 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":139}] |
Minimum variable degree | 2 |
Maximum variable degree | 112 |
Distribution of variable degrees | [{"degree":2,"count":106},{"degree":111,"count":6},{"degree":112,"count":27}] |
Minimum constraint arity | 1 |
Maximum constraint arity | 24 |
Distribution of constraint arities | [{"arity":1,"count":1},{"arity":10,"count":2},{"arity":11,"count":7},{"arity":12,"count":20},{"arity":13,"count":6},{"arity":16,"count":6},{"arity":17,"count":54},{"arity":18,"count":54},{"arity":19,"count":6},{"arity":22,"count":12},{"arity":23,"count":36},{"arity":24,"count":12}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":216}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 2 (complete) | 4394769 | OPT | 17 | 0.293746 | 0.294792 |
cosoco 2.0 (complete) | 4397453 | OPT | 17 | 0.296512 | 0.302323 |
cosoco 2.0 (complete) | 4408713 | OPT | 17 | 0.298879 | 0.300302 |
(reference) PicatSAT 2019-09-12 (complete) | 4407765 | OPT | 17 | 2.85006 | 2.85158 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 17<instantiation type='solution' cost='17'> <list>x[0] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[10] x[110] x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[11] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128] x[129] x[12] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] 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[94] x[95] x[96] x[97] x[98] x[99] x[9] </list> <values>0 1 1 1 1 0 1 1 1 1 0 0 1 0 0 0 1 1 0 0 1 1 0 1 0 1 1 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 1 1 1 0 1 0 0 0 0 1 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 0 </values> </instantiation>