| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-19-a4.xml |
| MD5SUM | 264cffe383a4c1beb81f164e203eb53e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 329 |
| Best CPU time to get the best result obtained on this benchmark | 248.836 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 19 |
| Number of constraints | 13568 |
| Number of domains | 1 |
| Minimum domain size | 501 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":501,"count":19}] |
| Minimum variable degree | 2755 |
| Maximum variable degree | 2756 |
| Distribution of variable degrees | [{"degree":2755,"count":17},{"degree":2756,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 19 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":1938},{"arity":4,"count":11628},{"arity":19,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 13567 |
| Distribution of constraint types | [{"type":"intension","count":13567},{"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: 329<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] x[17] x[18] </list> <values> 0 2 8 11 58 88 123 136 160 187 233 253 269 295 307 314 324 328 329 </values> </instantiation>