| Name | GolombRuler/GolombRuler-a4-s1/ GolombRuler-09-a4.xml |
| MD5SUM | 24dd80e7bb1ef2b7df88c183d3ee4992 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 44 |
| Best CPU time to get the best result obtained on this benchmark | 6.7931099 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 9 |
| Number of constraints | 548 |
| Number of domains | 1 |
| Minimum domain size | 501 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":501,"count":9}] |
| Minimum variable degree | 225 |
| Maximum variable degree | 226 |
| Distribution of variable degrees | [{"degree":225,"count":7},{"degree":226,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":168},{"arity":4,"count":378},{"arity":9,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 547 |
| Distribution of constraint types | [{"type":"intension","count":547},{"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: 44<instantiation> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] </list> <values> 0 1 5 12 25 27 35 41 44 </values> </instantiation>