Name | PseudoBoolean/PseudoBoolean-opt-mps/ Pb-mps-v2-20-10-p0040.xml |
MD5SUM | 1df45f623f00e03c25ba1b3396194e1d |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 62027 |
Best CPU time to get the best result obtained on this benchmark | 11.2144 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 40 |
Number of constraints | 23 |
Number of domains | 1 |
Minimum domain size | 2 |
Maximum domain size | 2 |
Distribution of domain sizes | [{"size":2,"count":40}] |
Minimum variable degree | 3 |
Maximum variable degree | 4 |
Distribution of variable degrees | [{"degree":3,"count":10},{"degree":4,"count":30}] |
Minimum constraint arity | 4 |
Maximum constraint arity | 10 |
Distribution of constraint arities | [{"arity":4,"count":20},{"arity":10,"count":3}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"sum","count":23}] |
Optimization problem | YES |
Type of objective | min SUM |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
cosoco 2 (complete) | 4394781 | OPT | 62027 | 11.2144 | 11.217 |
cosoco 2.0 (complete) | 4397444 | OPT | 62027 | 11.2685 | 11.2692 |
cosoco 2.0 (complete) | 4408704 | OPT | 62027 | 11.2752 | 11.2812 |
(reference) PicatSAT 2019-09-12 (complete) | 4407785 | OPT | 62027 | 137.878 | 137.873 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 62027<instantiation type='solution' cost='62027'> <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[4] x[5] x[6] x[7] x[8] x[9] </list> <values>0 0 0 0 0 1 0 0 1 0 0 1 0 1 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 0 </values> </instantiation>