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