| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-10-a4.xml |
| MD5SUM | 5c3e91a7aa658c047886207443b7266d |
| 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 | 37.235699 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 10 |
| Number of constraints | 872 |
| Number of domains | 1 |
| Minimum domain size | 501 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":501,"count":10}] |
| Minimum variable degree | 325 |
| Maximum variable degree | 326 |
| Distribution of variable degrees | [{"degree":325,"count":8},{"degree":326,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":240},{"arity":4,"count":630},{"arity":10,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 871 |
| Distribution of constraint types | [{"type":"intension","count":871},{"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: 55<instantiation> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] </list> <values> 0 2 14 21 29 32 45 49 54 55 </values> </instantiation>