| Name | Quasigroups/ QuasiGroup-4-09_c18.xml |
| MD5SUM | 32889b6f2e93f59096a50faf26931df2 |
| Bench Category | CSP (decision problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 4.81769 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 162 |
| Number of constraints | 146 |
| Number of domains | 2 |
| Minimum domain size | 9 |
| Maximum domain size | 81 |
| Distribution of domain sizes | [{"size":9,"count":81},{"size":81,"count":72}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 75 |
| Distribution of variable degrees | [{"degree":0,"count":9},{"degree":2,"count":72},{"degree":74,"count":9},{"degree":75,"count":72}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 82 |
| Distribution of constraint arities | [{"arity":3,"count":72},{"arity":9,"count":1},{"arity":81,"count":1},{"arity":82,"count":72}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 72 |
| Distribution of constraint types | [{"type":"intension","count":72},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":72}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297721 | SAT | 4.81769 | 1.19792 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291308 | SAT | 10.0866 | 4.47428 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296986 | SAT | 10.4992 | 3.339 |
| scop both+glucose-syrup (2018-07-07) (complete) | 4297222 | SAT | 10.6139 | 3.36329 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307170 | SAT | 11.8534 | 4.50611 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307406 | SAT | 12.1212 | 4.32383 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309077 | SAT | 381.771 | 216.263 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function:<instantiation> <list>x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[5][0] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[6][0] x[6][1] x[6][2] x[6][3] x[6][4] x[6][5] x[6][6] x[6][7] x[6][8] x[7][0] x[7][1] x[7][2] x[7][3] x[7][4] x[7][5] x[7][6] x[7][7] x[7][8] x[8][0] x[8][1] x[8][2] x[8][3] x[8][4] x[8][5] x[8][6] x[8][7] x[8][8] 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][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][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][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][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][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][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][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] </list> <values>0 5 1 2 8 4 7 3 6 8 1 0 5 6 7 4 2 3 7 3 2 6 1 8 0 5 4 1 4 5 3 7 2 8 6 0 3 7 6 0 4 1 5 8 2 6 8 4 7 3 5 2 0 1 5 2 8 1 0 3 6 4 7 4 0 3 8 2 6 1 7 5 2 6 7 4 5 0 3 1 8 77 64 11 35 58 52 39 24 53 27 41 69 79 22 2 57 16 3 51 55 44 72 32 67 19 49 59 7 65 17 78 36 75 61 15 63 28 5 26 47 42 71 76 25 12 29 54 1 68 38 8 73 45 21 13 34 31 18 48 62 74 6 37 14 56 33 43 4 23 9 66 46 </values> </instantiation>