| Name | GolombRuler/ GolombRuler-a3v18-08_c18.xml |
| MD5SUM | 5c5040f535ec624befc4f337dc6f1e70 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 34 |
| Best CPU time to get the best result obtained on this benchmark | 0.294383 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 72 |
| Number of constraints | 29 |
| Number of domains | 2 |
| Minimum domain size | 64 |
| Maximum domain size | 65 |
| Distribution of domain sizes | [{"size":64,"count":28},{"size":65,"count":8}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 8 |
| Distribution of variable degrees | [{"degree":0,"count":36},{"degree":2,"count":28},{"degree":7,"count":7},{"degree":8,"count":1}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 28 |
| Distribution of constraint arities | [{"arity":3,"count":28},{"arity":28,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 28 |
| Distribution of constraint types | [{"type":"intension","count":28},{"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) | 4312645 | OPT | 34 | 0.17157 | 0.172355 |
| cosoco 1.12 (complete) | 4301839 | OPT | 34 | 0.294383 | 0.295449 |
| OscaR - Hybrid 2018-08-14 (complete) | 4310325 | OPT | 34 | 2.3122 | 1.28575 |
| OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312185 | OPT | 34 | 2.70836 | 1.43857 |
| Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301837 | OPT | 34 | 8.66983 | 4.71255 |
| Concrete 3.9.2 (complete) | 4302349 | OPT | 34 | 9.46553 | 4.6982 |
| Concrete 3.9.2-SuperNG (complete) | 4302699 | OPT | 34 | 10.4095 | 5.15103 |
| Sat4j-CSP 2018-07-11 (complete) | 4301838 | OPT | 34 | 58.3453 | 55.6661 |
| OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309975 | SAT | 34 | 251.726 | 247.366 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 34<instantiation type="optimum" cost="34"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] 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[1][0] y[1][1] y[1][2] y[1][3] y[1][4] y[1][5] y[1][6] y[1][7] 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[3][0] y[3][1] y[3][2] y[3][3] y[3][4] y[3][5] y[3][6] y[3][7] 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[5][0] y[5][1] y[5][2] y[5][3] y[5][4] y[5][5] y[5][6] y[5][7] 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[7][0] y[7][1] y[7][2] y[7][3] y[7][4] y[7][5] y[7][6] y[7][7] </list> <values> 0 2 12 19 25 30 33 34 * 2 12 19 25 30 33 34 * * 10 17 23 28 31 32 * * * 7 13 18 21 22 * * * * 6 11 14 15 * * * * * 5 8 9 * * * * * * 3 4 * * * * * * * 1 * * * * * * * * </values> </instantiation>