| Name | GolombRuler/ GolombRuler-a3v18-nodv-09_c18.xml |
| MD5SUM | 5099229ea21e0b755c9ada14ed0c0ccc |
| 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 | 8.57589 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 90 |
| Number of constraints | 37 |
| Number of domains | 2 |
| Minimum domain size | 81 |
| Maximum domain size | 82 |
| Distribution of domain sizes | [{"size":81,"count":36},{"size":82,"count":9}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":45},{"degree":2,"count":36},{"degree":8,"count":8},{"degree":9,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":3,"count":36},{"arity":36,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 36 |
| Distribution of constraint types | [{"type":"intension","count":36},{"type":"allDifferent","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] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6] y[0][7] y[0][8] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] y[1][8] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[4][5] y[4][6] y[4][7] y[4][8] y[5][6] y[5][7] y[5][8] y[6][7] y[6][8] y[7][8] </list> <values>0 1 5 12 25 27 35 41 44 1 5 12 25 27 35 41 44 4 11 24 26 34 40 43 7 20 22 30 36 39 13 15 23 29 32 2 10 16 19 8 14 17 6 9 3 </values> </instantiation>