| Name | LowAutocorrelation/LowAutocorrelation-m1-s1/ LowAutocorrelation-018.xml |
| MD5SUM | 656c4a2fb65f2a7fc120fc4ddb475e5d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 25 |
| Best CPU time to get the best result obtained on this benchmark | 17.6106 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 341 |
| Number of constraints | 187 |
| Number of domains | 35 |
| Minimum domain size | 2 |
| Maximum domain size | 35 |
| Distribution of domain sizes | [{"size":2,"count":172},{"size":3,"count":2},{"size":4,"count":1},{"size":5,"count":2},{"size":6,"count":1},{"size":7,"count":2},{"size":8,"count":1},{"size":9,"count":2},{"size":10,"count":1},{"size":11,"count":2},{"size":12,"count":1},{"size":13,"count":2},{"size":14,"count":1},{"size":15,"count":2},{"size":16,"count":1},{"size":17,"count":2},{"size":18,"count":1},{"size":19,"count":1},{"size":21,"count":1},{"size":23,"count":1},{"size":25,"count":1},{"size":27,"count":1},{"size":29,"count":1},{"size":31,"count":1},{"size":33,"count":1},{"size":35,"count":1}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 17 |
| Distribution of variable degrees | [{"degree":0,"count":136},{"degree":2,"count":187},{"degree":17,"count":18}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 18 |
| Distribution of constraint arities | [{"arity":2,"count":18},{"arity":3,"count":154},{"arity":4,"count":1},{"arity":5,"count":1},{"arity":6,"count":1},{"arity":7,"count":1},{"arity":8,"count":1},{"arity":9,"count":1},{"arity":10,"count":1},{"arity":11,"count":1},{"arity":12,"count":1},{"arity":13,"count":1},{"arity":14,"count":1},{"arity":15,"count":1},{"arity":16,"count":1},{"arity":17,"count":1},{"arity":18,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 170 |
| Distribution of constraint types | [{"type":"intension","count":170},{"type":"sum","count":17}] |
| 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) | 4407646 | OPT | 25 | 17.6106 | 17.617 |
| cosoco 2.0 (complete) | 4397470 | OPT | 25 | 60.3902 | 60.3918 |
| cosoco 2.0 (complete) | 4408730 | OPT | 25 | 60.7149 | 60.7148 |
| cosoco 2 (complete) | 4394725 | OPT | 25 | 60.955 | 60.9748 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 25<instantiation> <list> y[][] x[] s[] c[] </list> <values> -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 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 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 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 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 -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 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 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 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 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 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 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 -1 1 -1 -1 1 1 -1 1 0 1 4 1 4 1 0 1 4 1 0 1 0 1 4 1 -1 0 -1 -2 -1 -2 -1 0 -1 2 -1 0 -1 0 -1 2 -1 </values> </instantiation>