| Name | Quasigroups/ QuasiGroup-4-12_c18.xml |
| MD5SUM | 31fb3bf3c58be033c7e9cdff116e7260 |
| 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 | 576.682 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 288 |
| Number of constraints | 266 |
| Number of domains | 2 |
| Minimum domain size | 12 |
| Maximum domain size | 144 |
| Distribution of domain sizes | [{"size":12,"count":144},{"size":144,"count":132}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 135 |
| Distribution of variable degrees | [{"degree":0,"count":12},{"degree":2,"count":132},{"degree":134,"count":12},{"degree":135,"count":132}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 145 |
| Distribution of constraint arities | [{"arity":3,"count":132},{"arity":12,"count":1},{"arity":144,"count":1},{"arity":145,"count":132}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 132 |
| Distribution of constraint types | [{"type":"intension","count":132},{"type":"allDifferent","count":1},{"type":"instantiation","count":1},{"type":"element","count":132}] |
| Optimization problem | NO |
| Type of objective |
| Solver Name | TraceID | Answer | CPU time | Wall clock time |
|---|---|---|---|---|
| scop both+glucose-syrup (2018-07-07) (complete) | 4297224 | SAT | 576.682 | 76.011 |
| scop order+glucose-syrup (2018-07-07) (complete) | 4296988 | SAT | 1973.66 | 251.354 |
| scop both+glucose-syrup (2018-07-31) (complete) | 4307408 | SAT | 2309.6 | 294.132 |
| scop order+glucose-syrup (2018-07-31) (complete) | 4307172 | SAT | 12450.8 | 1565.57 |
| OscaR - Parallel with EPS 2018-08-14 (complete) | 4309079 | ? (TO) | 19870.7 | 2520.34 |
| OscaR - Parallel with EPS 2018-07-02 (complete) | 4291310 | ? (TO) | 19870.9 | 2520.35 |
| Choco-solver 4.0.7b par (e747e1e) (complete) | 4297723 | ? (TO) | 20078.4 | 2520.11 |
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[0][9] x[0][10] x[0][11] 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[1][9] x[1][10] x[1][11] 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[2][9] x[2][10] x[2][11] 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[3][9] x[3][10] x[3][11] 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[4][9] x[4][10] x[4][11] 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[5][9] x[5][10] x[5][11] 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[6][9] x[6][10] x[6][11] 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[7][9] x[7][10] x[7][11] 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] x[8][9] x[8][10] x[8][11] x[9][0] x[9][1] x[9][2] x[9][3] x[9][4] x[9][5] x[9][6] x[9][7] x[9][8] x[9][9] x[9][10] x[9][11] x[10][0] x[10][1] x[10][2] x[10][3] x[10][4] x[10][5] x[10][6] x[10][7] x[10][8] x[10][9] x[10][10] x[10][11] x[11][0] x[11][1] x[11][2] x[11][3] x[11][4] x[11][5] x[11][6] x[11][7] x[11][8] x[11][9] x[11][10] x[11][11] 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][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][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][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][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][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][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][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][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][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][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]</list> <values>0 7 8 4 1 11 10 2 9 3 6 5 11 1 7 5 6 9 2 3 0 8 4 10 1 5 2 7 3 8 4 10 11 6 0 9 8 11 0 3 9 4 7 6 5 10 1 2 10 8 5 0 4 7 11 9 3 1 2 6 6 4 9 2 10 5 0 1 7 11 8 3 2 9 11 1 8 10 6 5 4 7 3 0 3 6 4 9 11 2 8 7 10 0 5 1 7 2 3 10 0 6 1 11 8 5 9 4 4 10 1 6 5 0 3 8 2 9 11 7 5 0 6 11 7 3 9 4 1 2 10 8 9 3 10 8 2 1 5 0 6 4 7 11 139 20 100 121 83 34 38 93 51 66 113 95 67 137 102 57 110 75 24 128 4 46 97 89 7 63 116 136 58 47 18 72 129 56 71 84 9 28 19 114 125 82 133 98 22 80 41 108 127 107 141 3 61 86 30 138 112 105 50 94 120 25 79 11 44 15 122 33 59 85 140 10 101 16 43 111 60 27 42 124 81 119 14 68 142 96 53 1 115 2 135 70 36 90 49 131 29 21 76 40 106 73 126 17 132 87 8 62 35 55 77 48 6 23 31 99 45 64 109 134 92 69 123 118 32 74 37 5 12 54 88 103</values> </instantiation>