| Name | GolombRuler/ GolombRuler-a3v18-nodv-09_c18.xml |
| MD5SUM | 5099229ea21e0b755c9ada14ed0c0ccc |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 44 |
| Best CPU time to get the best result obtained on this benchmark | 11.6408 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 90 |
| Number of constraints | 37 |
| Number of domains | 2 |
| Minimum domain size | 81 |
| Maximum domain size | 82 |
| Distribution of domain sizes | [{"size":81,"count":36},{"size":82,"count":9}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 9 |
| Distribution of variable degrees | [{"degree":0,"count":45},{"degree":2,"count":36},{"degree":8,"count":8},{"degree":9,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 36 |
| Distribution of constraint arities | [{"arity":3,"count":36},{"arity":36,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 36 |
| Distribution of constraint types | [{"type":"intension","count":36},{"type":"allDifferent","count":1}] |
| Optimization problem | YES |
| Type of objective | min VAR |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Mistral-2.0 2018-08-01 (complete) | 4312647 | OPT | 44 | 1.67407 | 1.67554 |
| cosoco 1.12 (complete) | 4301845 | OPT | 44 | 11.6408 | 11.6482 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301843 | OPT | 44 | 69.9165 | 66.4823 |
| Concrete 3.9.2 (complete) | 4302358 | OPT | 44 | 110.868 | 102.43 |
| Concrete 3.9.2-SuperNG (complete) | 4302708 | OPT | 44 | 209.951 | 199.46 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309984 | SAT | 44 | 249.879 | 247.879 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312194 | SAT | 44 | 250.434 | 247.367 |
| Sat4j-CSP 2018-07-11 (complete) | 4301844 | SAT (TO) | 44 | 252.185 | 247.818 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310334 | SAT (TO) | 47 | 252.033 | 245.437 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 44<instantiation type="optimum" cost="44"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] y[0][0] 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[1][0] 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[2][0] 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[3][0] 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[4][0] 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[5][0] 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[6][0] 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[7][0] 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[8][0] y[8][1] y[8][2] y[8][3] y[8][4] y[8][5] y[8][6] y[8][7] y[8][8] </list> <values> 0 1 5 12 25 27 35 41 44 * 1 5 12 25 27 35 41 44 * * 4 11 24 26 34 40 43 * * * 7 20 22 30 36 39 * * * * 13 15 23 29 32 * * * * * 2 10 16 19 * * * * * * 8 14 17 * * * * * * * 6 9 * * * * * * * * 3 * * * * * * * * * </values> </instantiation>