| Name | GolombRuler/ GolombRuler-a3v18-15_c18.xml |
| MD5SUM | 9d47b2b78bc459aa217a94cfbd52e9d7 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 160 |
| Best CPU time to get the best result obtained on this benchmark | 20029.4 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 240 |
| Number of constraints | 106 |
| Number of domains | 2 |
| Minimum domain size | 225 |
| Maximum domain size | 226 |
| Distribution of domain sizes | [{"size":225,"count":105},{"size":226,"count":15}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 15 |
| Distribution of variable degrees | [{"degree":0,"count":120},{"degree":2,"count":105},{"degree":14,"count":14},{"degree":15,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 105 |
| Distribution of constraint arities | [{"arity":3,"count":105},{"arity":105,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 105 |
| Distribution of constraint types | [{"type":"intension","count":105},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297454 | SAT (TO) | 160 | 20029.4 | 2520.11 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291041 | ? (TO) | 19911.8 | 2520.37 | |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4308810 | ? (TO) | 19920.6 | 2520.47 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 160<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] x[14] 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[0][14] 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[1][14] 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[2][14] 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[3][14] 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[4][14] 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[5][14] y[6][7] y[6][8] y[6][9] y[6][10] y[6][11] y[6][12] y[6][13] y[6][14] y[7][8] y[7][9] y[7][10] y[7][11] y[7][12] y[7][13] y[7][14] y[8][9] y[8][10] y[8][11] y[8][12] y[8][13] y[8][14] y[9][10] y[9][11] y[9][12] y[9][13] y[9][14] y[10][11] y[10][12] y[10][13] y[10][14] y[11][12] y[11][13] y[11][14] y[12][13] y[12][14] y[13][14] </list> <values>0 3 5 25 38 56 62 70 116 120 131 143 150 159 160 3 5 25 38 56 62 70 116 120 131 143 150 159 160 2 22 35 53 59 67 113 117 128 140 147 156 157 20 33 51 57 65 111 115 126 138 145 154 155 13 31 37 45 91 95 106 118 125 134 135 18 24 32 78 82 93 105 112 121 122 6 14 60 64 75 87 94 103 104 8 54 58 69 81 88 97 98 46 50 61 73 80 89 90 4 15 27 34 43 44 11 23 30 39 40 12 19 28 29 7 16 17 9 10 1 </values> </instantiation>