| 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.295264 |
| 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 |
|---|---|---|---|---|---|
| cosoco 1.12 (complete) | 4299402 | OPT | 34 | 0.295264 | 0.29577 |
| Solver of Xavier Schul & Yvhan Smal 2018-04-28 (incomplete) | 4299406 | OPT | 34 | 5.76902 | 4.5065 |
| SuperSolver_Macq_Stevenart 2018-04-27 (incomplete) | 4299407 | SAT | 34 | 302.65 | 300.35 |
| slowpoke 2018-04-29 (incomplete) | 4299405 | SAT (TO) | 34 | 2520.06 | 2509.91 |
| The dodo solver 2018-04-29 (complete) | 4299408 | SAT (TO) | 34 | 2520.1 | 2514.51 |
| GG's minicp 2018-04-29 (complete) | 4299403 | SAT (TO) | 40 | 2520.08 | 2506.82 |
| MiniCPFever 2018-04-29 (complete) | 4299404 | Wrong UNSAT | 4.42448 | 2.80255 |
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='solution' 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 1 4 9 15 22 32 34 * 1 4 9 15 22 32 34 * * 3 8 14 21 31 33 * * * 5 11 18 28 30 * * * * 6 13 23 25 * * * * * 7 17 19 * * * * * * 10 12 * * * * * * * 2 * * * * * * * * </values> </instantiation>