| Name | GolombRuler/ GolombRuler-a3v18-13_c18.xml |
| MD5SUM | 66cce14b45be89e007abc3e2885e8941 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 109 |
| Best CPU time to get the best result obtained on this benchmark | 2520.09 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 182 |
| Number of constraints | 79 |
| Number of domains | 2 |
| Minimum domain size | 169 |
| Maximum domain size | 170 |
| Distribution of domain sizes | [{"size":169,"count":78},{"size":170,"count":13}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 13 |
| Distribution of variable degrees | [{"degree":0,"count":91},{"degree":2,"count":78},{"degree":12,"count":12},{"degree":13,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 78 |
| Distribution of constraint arities | [{"arity":3,"count":78},{"arity":78,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 78 |
| Distribution of constraint types | [{"type":"intension","count":78},{"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) | 4299376 | SAT (TO) | 109 | 2520.09 | 2445.92 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299378 | SAT (TO) | 110 | 2520.05 | 2511.52 |
| cosoco 1.12 (complete) | 4299374 | SAT (TO) | 113 | 2520.1 | 2519.9 |
| slowpoke 2018-04-29 (incomplete) | 4299377 | SAT (TO) | 114 | 2520.1 | 2509.32 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299379 | SAT | 116 | 302.626 | 300.405 |
| The dodo solver 2018-04-29 (complete) | 4299380 | SAT (TO) | 124 | 2520.12 | 2516.42 |
| GG's minicp 2018-04-29 (complete) | 4299375 | SAT (TO) | 147 | 2520.07 | 2506.41 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 109<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] 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[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[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[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[4][5] y[4][6] y[4][7] y[4][8] y[4][9] y[4][10] y[4][11] y[4][12] y[5][6] y[5][7] y[5][8] y[5][9] y[5][10] y[5][11] y[5][12] y[6][7] y[6][8] y[6][9] y[6][10] y[6][11] y[6][12] y[7][8] y[7][9] y[7][10] y[7][11] y[7][12] y[8][9] y[8][10] y[8][11] y[8][12] y[9][10] y[9][11] y[9][12] y[10][11] y[10][12] y[11][12] </list> <values> 0 2 3 16 26 34 54 61 73 94 98 103 109 2 3 16 26 34 54 61 73 94 98 103 109 1 14 24 32 52 59 71 92 96 101 107 13 23 31 51 58 70 91 95 100 106 10 18 38 45 57 78 82 87 93 8 28 35 47 68 72 77 83 20 27 39 60 64 69 75 7 19 40 44 49 55 12 33 37 42 48 21 25 30 36 4 9 15 5 11 6 </values> </instantiation>