| Name | GolombRuler/ GolombRuler-a3v18-nodv-10_c18.xml |
| MD5SUM | 769ec0f26c47f1b96bb609b2e4d8d5d6 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 55 |
| Best CPU time to get the best result obtained on this benchmark | 306.942 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 110 |
| Number of constraints | 46 |
| Number of domains | 2 |
| Minimum domain size | 100 |
| Maximum domain size | 101 |
| Distribution of domain sizes | [{"size":100,"count":45},{"size":101,"count":10}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":0,"count":55},{"degree":2,"count":45},{"degree":9,"count":9},{"degree":10,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 45 |
| Distribution of constraint arities | [{"arity":3,"count":45},{"arity":45,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 45 |
| Distribution of constraint types | [{"type":"intension","count":45},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407896 | OPT | 55 | 306.942 | 306.954 |
| cosoco 2.0 (complete) | 4397519 | OPT | 55 | 860.549 | 860.603 |
| cosoco 2 (complete) | 4394836 | OPT | 55 | 868.748 | 868.791 |
| cosoco 2.0 (complete) | 4408779 | OPT | 55 | 989.471 | 989.392 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 55<instantiation> <list> x[] y[][] </list> <values> 0 2 14 21 29 32 45 49 54 55 16 2 14 21 29 32 45 49 54 55 16 16 12 19 27 30 43 47 52 53 16 8 8 7 15 18 31 35 40 41 16 16 8 16 8 11 24 28 33 34 16 16 16 2 16 3 16 20 25 26 2 16 16 16 16 2 13 17 22 23 16 1 1 16 1 16 16 4 9 10 8 1 16 2 16 2 8 8 5 6 1 2 16 16 8 1 2 2 2 1 1 1 16 16 8 8 8 16 1 8 </values> </instantiation>