| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-05-a4.xml |
| MD5SUM | b250af75cdbd7045c96107bc259ab78e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 11 |
| Best CPU time to get the best result obtained on this benchmark | 0.070707001 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 5 |
| Number of constraints | 37 |
| Number of domains | 1 |
| Minimum domain size | 501 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":501,"count":5}] |
| Minimum variable degree | 25 |
| Maximum variable degree | 26 |
| Distribution of variable degrees | [{"degree":25,"count":3},{"degree":26,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 5 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":20},{"arity":4,"count":15},{"arity":5,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 36 |
| Distribution of constraint types | [{"type":"intension","count":36},{"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: 11<instantiation type='solution' cost='11'> <list>x[0] x[1] x[2] x[3] x[4] </list> <values>0 1 4 9 11 </values> </instantiation>