| 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 | 161 |
| Best CPU time to get the best result obtained on this benchmark | 2520.04 |
| 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 |
|---|---|---|---|---|---|
| GG's minicp 2018-04-29 (complete) | 4299389 | SAT (TO) | 161 | 2520.04 | 2479.82 |
| MiniCPFever 2018-04-29 (complete) | 4299390 | SAT (TO) | 162 | 2520.05 | 2452.23 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299392 | SAT (TO) | 162 | 2520.11 | 2511.13 |
| slowpoke 2018-04-29 (incomplete) | 4299391 | SAT (TO) | 170 | 2520.06 | 2508.22 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299393 | SAT | 173 | 302.702 | 300.443 |
| cosoco 1.12 (complete) | 4299388 | SAT (TO) | 176 | 2520.08 | 2519.9 |
| The dodo solver 2018-04-29 (complete) | 4299394 | SAT (TO) | 197 | 2520.09 | 2516.52 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 161<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 1 3 7 17 35 56 65 85 110 125 137 148 156 161 1 3 7 17 35 56 65 85 110 125 137 148 156 161 2 6 16 34 55 64 84 109 124 136 147 155 160 4 14 32 53 62 82 107 122 134 145 153 158 10 28 49 58 78 103 118 130 141 149 154 18 39 48 68 93 108 120 131 139 144 21 30 50 75 90 102 113 121 126 9 29 54 69 81 92 100 105 20 45 60 72 83 91 96 25 40 52 63 71 76 15 27 38 46 51 12 23 31 36 11 19 24 8 13 5 </values> </instantiation>