| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-06-a4.xml |
| MD5SUM | 3be13f028e00a9c301b8790857e4d16d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 17 |
| Best CPU time to get the best result obtained on this benchmark | 0.213054 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 6 |
| Number of constraints | 87 |
| Number of domains | 1 |
| Minimum domain size | 501 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":501,"count":6}] |
| Minimum variable degree | 51 |
| Maximum variable degree | 52 |
| Distribution of variable degrees | [{"degree":51,"count":4},{"degree":52,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 6 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":40},{"arity":4,"count":45},{"arity":6,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 86 |
| Distribution of constraint types | [{"type":"intension","count":86},{"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: 17<instantiation type="optimum" cost="17"> <list> x[0] x[1] x[2] x[3] x[4] x[5] </list> <values> 0 1 4 10 12 17 </values> </instantiation>