| Name | LowAutocorrelation/LowAutocorrelation-m1-s1/ LowAutocorrelation-019.xml |
| MD5SUM | 4db16cf953bf17f15cb901b9adc08541 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 29 |
| Best CPU time to get the best result obtained on this benchmark | 32.2315 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 379 |
| Number of constraints | 207 |
| Number of domains | 37 |
| Minimum domain size | 2 |
| Maximum domain size | 37 |
| Distribution of domain sizes | [{"size":2,"count":191},{"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":2},{"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},{"size":37,"count":1}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 18 |
| Distribution of variable degrees | [{"degree":0,"count":153},{"degree":2,"count":207},{"degree":18,"count":19}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 19 |
| Distribution of constraint arities | [{"arity":2,"count":19},{"arity":3,"count":172},{"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},{"arity":19,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 189 |
| Distribution of constraint types | [{"type":"intension","count":189},{"type":"sum","count":18}] |
| 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) | 4407648 | OPT | 29 | 32.2315 | 32.2372 |
| cosoco 2 (complete) | 4394727 | OPT | 29 | 133.222 | 133.234 |
| cosoco 2.0 (complete) | 4397543 | OPT | 29 | 133.396 | 133.399 |
| cosoco 2.0 (complete) | 4408803 | OPT | 29 | 133.545 | 133.549 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 29<instantiation> <list> s[] c[] y[][] x[] </list> <values> 0 1 0 1 0 1 0 9 0 1 4 1 0 1 4 1 4 1 0 1 0 1 0 -1 0 -3 0 -1 2 -1 0 -1 -2 -1 -2 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 </values> </instantiation>