Name | GolombRuler/ GolombRuler-a3v18-12_c18.xml |
MD5SUM | c13fad5df3b78eadb31ee9887672a536 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | SAT |
Best value of the objective obtained on this benchmark | 92 |
Best CPU time to get the best result obtained on this benchmark | 250.493 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 156 |
Number of constraints | 67 |
Number of domains | 2 |
Minimum domain size | 144 |
Maximum domain size | 145 |
Distribution of domain sizes | [{"size":144,"count":66},{"size":145,"count":12}] |
Minimum variable degree | 0 |
Maximum variable degree | 12 |
Distribution of variable degrees | [{"degree":0,"count":78},{"degree":2,"count":66},{"degree":11,"count":11},{"degree":12,"count":1}] |
Minimum constraint arity | 3 |
Maximum constraint arity | 66 |
Distribution of constraint arities | [{"arity":3,"count":66},{"arity":66,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 66 |
Distribution of constraint types | [{"type":"intension","count":66},{"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) | 4312646 | SAT (TO) | 91 | 252.01 | 252.01 |
OscaR - Conflict Ordering with restarts 2018-08-17 (complete) | 4312189 | SAT | 92 | 250.493 | 247.364 |
OscaR - Conflict Ordering with restarts 2018-08-14 (complete) | 4309979 | SAT | 93 | 250.613 | 247.364 |
Concrete 3.9.2 (complete) | 4302353 | SAT (TO) | 93 | 252.091 | 241.347 |
cosoco 1.12 (complete) | 4301842 | SAT (TO) | 94 | 251.988 | 252.01 |
OscaR - Hybrid 2018-08-14 (complete) | 4310329 | SAT (TO) | 96 | 252.078 | 246.327 |
Concrete 3.9.2-SuperNG (complete) | 4302703 | SAT (TO) | 96 | 252.148 | 240.537 |
Choco-solver 4.0.7b seq (e747e1e) (complete) | 4301840 | SAT (TO) | 104 | 252.024 | 247.214 |
Sat4j-CSP 2018-07-11 (complete) | 4301841 | SAT (TO) | 124 | 252.13 | 243.82 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 91<instantiation type="solution"> <list> x[0] x[1] x[2] x[3] x[4] x[5] x[6] x[7] x[8] x[9] x[10] x[11] 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[0][9] y[0][10] y[0][11] 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[1][9] y[1][10] y[1][11] 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[2][9] y[2][10] y[2][11] 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[3][9] y[3][10] y[3][11] 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[4][9] y[4][10] y[4][11] 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[5][9] y[5][10] y[5][11] 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[6][9] y[6][10] y[6][11] 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[7][9] y[7][10] y[7][11] 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] y[8][9] y[8][10] y[8][11] y[9][0] 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] y[9][10] y[9][11] y[10][0] 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[10][10] y[10][11] y[11][0] y[11][1] y[11][2] y[11][3] y[11][4] y[11][5] y[11][6] y[11][7] y[11][8] y[11][9] y[11][10] y[11][11] </list> <values> 0 1 4 9 26 41 55 61 68 79 89 91 * 1 4 9 26 41 55 61 68 79 89 91 * * 3 8 25 40 54 60 67 78 88 90 * * * 5 22 37 51 57 64 75 85 87 * * * * 17 32 46 52 59 70 80 82 * * * * * 15 29 35 42 53 63 65 * * * * * * 14 20 27 38 48 50 * * * * * * * 6 13 24 34 36 * * * * * * * * 7 18 28 30 * * * * * * * * * 11 21 23 * * * * * * * * * * 10 12 * * * * * * * * * * * 2 * * * * * * * * * * * * </values> </instantiation>