| Name | GolombRuler/ GolombRuler-a3v18-11_c18.xml |
| MD5SUM | ed3f9a47d1f1ba76ff72e7160e212ad4 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 72 |
| Best CPU time to get the best result obtained on this benchmark | 372.302 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 132 |
| Number of constraints | 56 |
| Number of domains | 2 |
| Minimum domain size | 121 |
| Maximum domain size | 122 |
| Distribution of domain sizes | [{"size":121,"count":55},{"size":122,"count":11}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":0,"count":66},{"degree":2,"count":55},{"degree":10,"count":10},{"degree":11,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 55 |
| Distribution of constraint arities | [{"arity":3,"count":55},{"arity":55,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 55 |
| Distribution of constraint types | [{"type":"intension","count":55},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4299346 | OPT | 72 | 372.302 | 372.325 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299350 | SAT (TO) | 72 | 2520.04 | 2512.51 |
| slowpoke 2018-04-29 (incomplete) | 4299349 | SAT (TO) | 72 | 2520.04 | 2509.12 |
| MiniCPFever 2018-04-29 (complete) | 4299348 | SAT (TO) | 72 | 2520.07 | 2423.53 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299351 | SAT | 74 | 302.564 | 300.371 |
| The dodo solver 2018-04-29 (complete) | 4299352 | SAT (TO) | 78 | 2520.03 | 2516.12 |
| GG's minicp 2018-04-29 (complete) | 4299347 | SAT (TO) | 96 | 2520.11 | 2509.02 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 72<instantiation type='solution' cost='72'> <list>x[0] x[10] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] y[0][0] y[0][10] 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[10][0] y[10][10] y[10][1] y[10][2] y[10][3] y[10][4] y[10][5] y[10][6] y[10][7] y[10][8] y[10][9] y[1][0] y[1][10] y[1][1] 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[2][0] y[2][10] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[2][7] y[2][8] y[2][9] y[3][0] y[3][10] y[3][1] y[3][2] y[3][3] y[3][4] y[3][5] y[3][6] y[3][7] y[3][8] y[3][9] y[4][0] y[4][10] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[4][7] y[4][8] y[4][9] y[5][0] y[5][10] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] y[5][6] y[5][7] y[5][8] y[5][9] y[6][0] y[6][10] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] y[6][7] y[6][8] y[6][9] y[7][0] y[7][10] y[7][1] y[7][2] y[7][3] y[7][4] y[7][5] y[7][6] y[7][7] y[7][8] y[7][9] y[8][0] y[8][10] y[8][1] y[8][2] y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] y[8][9] y[9][0] y[9][10] y[9][1] y[9][2] y[9][3] y[9][4] y[9][5] y[9][6] y[9][7] y[9][8] y[9][9] </list> <values>0 72 1 4 13 28 33 47 54 64 70 * 72 1 4 13 28 33 47 54 64 70 * * * * * * * * * * * * 71 * 3 12 27 32 46 53 63 69 * 68 * * 9 24 29 43 50 60 66 * 59 * * * 15 20 34 41 51 57 * 44 * * * * 5 19 26 36 42 * 39 * * * * * 14 21 31 37 * 25 * * * * * * 7 17 23 * 18 * * * * * * * 10 16 * 8 * * * * * * * * 6 * 2 * * * * * * * * * </values> </instantiation>