| Name | GolombRuler/GolombRuler-a3-s1/ GolombRuler-14-a3.xml |
| MD5SUM | a5381fa3d98671549d41a8d043d26ba4 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 133 |
| Best CPU time to get the best result obtained on this benchmark | 19981 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 210 |
| Number of constraints | 94 |
| Number of domains | 2 |
| Minimum domain size | 500 |
| Maximum domain size | 501 |
| Distribution of domain sizes | [{"size":500,"count":91},{"size":501,"count":14}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 15 |
| Distribution of variable degrees | [{"degree":0,"count":105},{"degree":2,"count":91},{"degree":14,"count":12},{"degree":15,"count":2}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 91 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":3,"count":91},{"arity":14,"count":1},{"arity":91,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 92 |
| Distribution of constraint types | [{"type":"intension","count":92},{"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: 133<instantiation> <list>x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] x[12] x[13] 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[0][9] y[0][10] y[0][11] y[0][12] y[0][13] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] y[1][8] y[1][9] y[1][10] y[1][11] y[1][12] y[1][13] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[2][9] y[2][10] y[2][11] y[2][12] y[2][13] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[3][10] y[3][11] y[3][12] y[3][13] y[4][5] y[4][6] y[4][7] y[4][8] y[4][9] y[4][10] y[4][11] y[4][12] y[4][13] y[5][6] y[5][7] y[5][8] y[5][9] y[5][10] y[5][11] y[5][12] y[5][13] y[6][7] y[6][8] y[6][9] y[6][10] y[6][11] y[6][12] y[6][13] y[7][8] y[7][9] y[7][10] y[7][11] y[7][12] y[7][13] y[8][9] y[8][10] y[8][11] y[8][12] y[8][13] y[9][10] y[9][11] y[9][12] y[9][13] y[10][11] y[10][12] y[10][13] y[11][12] y[11][13] y[12][13] </list> <values>0 1 3 23 28 39 57 71 83 92 116 123 129 133 1 3 23 28 39 57 71 83 92 116 123 129 133 2 22 27 38 56 70 82 91 115 122 128 132 20 25 36 54 68 80 89 113 120 126 130 5 16 34 48 60 69 93 100 106 110 11 29 43 55 64 88 95 101 105 18 32 44 53 77 84 90 94 14 26 35 59 66 72 76 12 21 45 52 58 62 9 33 40 46 50 24 31 37 41 7 13 17 6 10 4 </values> </instantiation>