| Name | GolombRuler/GolombRuler-a3-s1/ GolombRuler-05-a3.xml |
| MD5SUM | 52bc390cc6b0904238f0f092c3eebf68 |
| 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.024444001 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 13 |
| Number of domains | 2 |
| Minimum domain size | 500 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":500,"count":10},{"size":501,"count":5}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 6 |
| Distribution of variable degrees | [{"degree":0,"count":15},{"degree":2,"count":10},{"degree":5,"count":3},{"degree":6,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 10 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":10},{"arity":5,"count":1},{"arity":10,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 11 |
| Distribution of constraint types | [{"type":"intension","count":11},{"type":"allDifferent","count":1},{"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="optimum" cost="11"> <list> x[0] x[1] x[2] x[3] x[4] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[3][0] y[3][1] y[3][2] y[3][3] y[3][4] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] </list> <values> 0 2 7 8 11 * 2 7 8 11 * * 5 6 9 * * * 1 4 * * * * 3 * * * * * </values> </instantiation>