| Name | GolombRuler/ GolombRuler-a3v18-16_c18.xml |
| MD5SUM | 056eb1ebd10e8d59a6677e448014ff35 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 192 |
| Best CPU time to get the best result obtained on this benchmark | 2520.07 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 272 |
| Number of constraints | 121 |
| Number of domains | 2 |
| Minimum domain size | 256 |
| Maximum domain size | 257 |
| Distribution of domain sizes | [{"size":256,"count":120},{"size":257,"count":16}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 16 |
| Distribution of variable degrees | [{"degree":0,"count":136},{"degree":2,"count":120},{"degree":15,"count":15},{"degree":16,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 120 |
| Distribution of constraint arities | [{"arity":3,"count":120},{"arity":120,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 120 |
| Distribution of constraint types | [{"type":"intension","count":120},{"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) | 4299361 | SAT (TO) | 192 | 2520.07 | 2477.32 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299364 | SAT (TO) | 196 | 2520.09 | 2511.52 |
| slowpoke 2018-04-29 (incomplete) | 4299363 | SAT (TO) | 201 | 2520.09 | 2508.42 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299365 | SAT | 202 | 302.686 | 300.474 |
| MiniCPFever 2018-04-29 (complete) | 4299362 | SAT (TO) | 204 | 2520.09 | 2445.63 |
| cosoco 1.12 (complete) | 4299360 | SAT (TO) | 212 | 2520.08 | 2519.9 |
| The dodo solver 2018-04-29 (complete) | 4299366 | SAT (TO) | 226 | 2520.02 | 2516.62 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 192<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] x[15] 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[0][15] 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[1][15] 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[2][15] 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[3][15] 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[4][15] 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[5][15] 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[6][15] y[7][8] y[7][9] y[7][10] y[7][11] y[7][12] y[7][13] y[7][14] y[7][15] y[8][9] y[8][10] y[8][11] y[8][12] y[8][13] y[8][14] y[8][15] y[9][10] y[9][11] y[9][12] y[9][13] y[9][14] y[9][15] y[10][11] y[10][12] y[10][13] y[10][14] y[10][15] y[11][12] y[11][13] y[11][14] y[11][15] y[12][13] y[12][14] y[12][15] y[13][14] y[13][15] y[14][15] </list> <values> 0 1 3 7 15 34 44 57 66 83 104 128 156 176 181 192 1 3 7 15 34 44 57 66 83 104 128 156 176 181 192 2 6 14 33 43 56 65 82 103 127 155 175 180 191 4 12 31 41 54 63 80 101 125 153 173 178 189 8 27 37 50 59 76 97 121 149 169 174 185 19 29 42 51 68 89 113 141 161 166 177 10 23 32 49 70 94 122 142 147 158 13 22 39 60 84 112 132 137 148 9 26 47 71 99 119 124 135 17 38 62 90 110 115 126 21 45 73 93 98 109 24 52 72 77 88 28 48 53 64 20 25 36 5 16 11 </values> </instantiation>