| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-17-a4.xml |
| MD5SUM | 1654769b6737315210eb217040901c4e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 248 |
| Best CPU time to get the best result obtained on this benchmark | 248.728 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 17 |
| Number of constraints | 8502 |
| Number of domains | 1 |
| Minimum domain size | 501 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":501,"count":17}] |
| Minimum variable degree | 1921 |
| Maximum variable degree | 1922 |
| Distribution of variable degrees | [{"degree":1921,"count":15},{"degree":1922,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 17 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":1360},{"arity":4,"count":7140},{"arity":17,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 8501 |
| Distribution of constraint types | [{"type":"intension","count":8501},{"type":"ordered","count":1}] |
| Optimization problem | YES |
| Type of objective | min VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 248<instantiation> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] x[14] x[15] x[16] </list> <values> 0 23 37 59 85 97 105 112 152 161 203 213 231 242 244 247 248 </values> </instantiation>