| Name | PseudoBoolean/PseudoBoolean-opt-factor/ Pb-factor-S9-P293-Q307.xml |
| MD5SUM | 254671fc607e3f1fca87da643fa2fbf5 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 293 |
| Best CPU time to get the best result obtained on this benchmark | 0.142511 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 99 |
| Number of constraints | 244 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":99}] |
| Minimum variable degree | 4 |
| Maximum variable degree | 19 |
| Distribution of variable degrees | [{"degree":4,"count":81},{"degree":18,"count":9},{"degree":19,"count":9}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 81 |
| Distribution of constraint arities | [{"arity":2,"count":162},{"arity":3,"count":81},{"arity":81,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":244}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407784 | OPT | 293 | 0.142511 | 0.142863 |
| cosoco 2.0 (complete) | 4397452 | OPT | 293 | 0.157638 | 0.159434 |
| cosoco 2 (complete) | 4394780 | OPT | 293 | 0.158028 | 0.159663 |
| cosoco 2.0 (complete) | 4408712 | OPT | 293 | 0.158902 | 0.160751 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 293<instantiation> <list> x[] </list> <values> 1 0 1 0 0 1 0 0 1 1 1 0 0 1 1 0 0 1 1 1 0 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0 0 1 </values> </instantiation>