| Name | GolombRuler/ GolombRuler-a3v18-14_c18.xml |
| MD5SUM | c1878b2d9e06b3112b686731368ac8cc |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 135 |
| Best CPU time to get the best result obtained on this benchmark | 2520.08 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 210 |
| Number of constraints | 92 |
| Number of domains | 2 |
| Minimum domain size | 196 |
| Maximum domain size | 197 |
| Distribution of domain sizes | [{"size":196,"count":91},{"size":197,"count":14}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 14 |
| Distribution of variable degrees | [{"degree":0,"count":105},{"degree":2,"count":91},{"degree":13,"count":13},{"degree":14,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 91 |
| Distribution of constraint arities | [{"arity":3,"count":91},{"arity":91,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 91 |
| Distribution of constraint types | [{"type":"intension","count":91},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| MiniCPFever 2018-04-29 (complete) | 4299369 | SAT (TO) | 135 | 2520.08 | 2446.34 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299371 | SAT (TO) | 135 | 2520.11 | 2513.22 |
| slowpoke 2018-04-29 (incomplete) | 4299370 | SAT (TO) | 140 | 2520.04 | 2507.61 |
| cosoco 1.12 (complete) | 4299367 | SAT (TO) | 141 | 2520.1 | 2519.9 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299372 | SAT | 145 | 302.543 | 300.419 |
| The dodo solver 2018-04-29 (complete) | 4299373 | SAT (TO) | 168 | 2520.03 | 2516.62 |
| GG's minicp 2018-04-29 (complete) | 4299368 | SAT (TO) | 177 | 2520.05 | 2505.91 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 135<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 7 18 39 51 73 82 98 108 122 127 135 1 3 7 18 39 51 73 82 98 108 122 127 135 2 6 17 38 50 72 81 97 107 121 126 134 4 15 36 48 70 79 95 105 119 124 132 11 32 44 66 75 91 101 115 120 128 21 33 55 64 80 90 104 109 117 12 34 43 59 69 83 88 96 22 31 47 57 71 76 84 9 25 35 49 54 62 16 26 40 45 53 10 24 29 37 14 19 27 5 13 8 </values> </instantiation>