| Name | GolombRuler/ GolombRuler-a3v18-07_c18.xml |
| MD5SUM | e42a0bd121bf3364b1a4e345eaac980a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 25 |
| Best CPU time to get the best result obtained on this benchmark | 0.040631 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 56 |
| Number of constraints | 22 |
| Number of domains | 2 |
| Minimum domain size | 49 |
| Maximum domain size | 50 |
| Distribution of domain sizes | [{"size":49,"count":21},{"size":50,"count":7}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 7 |
| Distribution of variable degrees | [{"degree":0,"count":28},{"degree":2,"count":21},{"degree":6,"count":6},{"degree":7,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":3,"count":21},{"arity":21,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 21 |
| Distribution of constraint types | [{"type":"intension","count":21},{"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) | 4312642 | OPT | 25 | 0.02996 | 0.0306241 |
| cosoco 1.12 (complete) | 4301830 | OPT | 25 | 0.040631 | 0.042841 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312184 | OPT | 25 | 1.81429 | 1.14693 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310324 | OPT | 25 | 1.88911 | 1.15889 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301828 | OPT | 25 | 2.69747 | 1.06108 |
| Concrete 3.9.2 (complete) | 4302348 | OPT | 25 | 7.59712 | 3.67603 |
| Concrete 3.9.2-SuperNG (complete) | 4302698 | OPT | 25 | 7.75792 | 3.74253 |
| Sat4j-CSP 2018-07-11 (complete) | 4301829 | OPT | 25 | 13.2064 | 10.6838 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309974 | SAT | 25 | 251.63 | 247.37 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 25<instantiation type="optimum" cost="25"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] y[0][0] y[0][1] y[0][2] y[0][3] y[0][4] y[0][5] y[0][6] y[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[2][0] y[2][1] y[2][2] y[2][3] y[2][4] y[2][5] y[2][6] y[3][0] y[3][1] y[3][2] y[3][3] y[3][4] y[3][5] y[3][6] y[4][0] y[4][1] y[4][2] y[4][3] y[4][4] y[4][5] y[4][6] y[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] y[5][6] y[6][0] y[6][1] y[6][2] y[6][3] y[6][4] y[6][5] y[6][6] </list> <values> 0 1 7 11 20 23 25 * 1 7 11 20 23 25 * * 6 10 19 22 24 * * * 4 13 16 18 * * * * 9 12 14 * * * * * 3 5 * * * * * * 2 * * * * * * * </values> </instantiation>