| Name | LowAutocorrelation/LowAutocorrelation-m1-s1/ LowAutocorrelation-018.xml |
| MD5SUM | 656c4a2fb65f2a7fc120fc4ddb475e5d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 25 |
| Best CPU time to get the best result obtained on this benchmark | 9.78389 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 341 |
| Number of constraints | 187 |
| Number of domains | 35 |
| Minimum domain size | 2 |
| Maximum domain size | 35 |
| Distribution of domain sizes | [{"size":2,"count":172},{"size":3,"count":2},{"size":4,"count":1},{"size":5,"count":2},{"size":6,"count":1},{"size":7,"count":2},{"size":8,"count":1},{"size":9,"count":2},{"size":10,"count":1},{"size":11,"count":2},{"size":12,"count":1},{"size":13,"count":2},{"size":14,"count":1},{"size":15,"count":2},{"size":16,"count":1},{"size":17,"count":2},{"size":18,"count":1},{"size":19,"count":1},{"size":21,"count":1},{"size":23,"count":1},{"size":25,"count":1},{"size":27,"count":1},{"size":29,"count":1},{"size":31,"count":1},{"size":33,"count":1},{"size":35,"count":1}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 17 |
| Distribution of variable degrees | [{"degree":0,"count":136},{"degree":2,"count":187},{"degree":17,"count":18}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 18 |
| Distribution of constraint arities | [{"arity":2,"count":18},{"arity":3,"count":154},{"arity":4,"count":1},{"arity":5,"count":1},{"arity":6,"count":1},{"arity":7,"count":1},{"arity":8,"count":1},{"arity":9,"count":1},{"arity":10,"count":1},{"arity":11,"count":1},{"arity":12,"count":1},{"arity":13,"count":1},{"arity":14,"count":1},{"arity":15,"count":1},{"arity":16,"count":1},{"arity":17,"count":1},{"arity":18,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 170 |
| Distribution of constraint types | [{"type":"intension","count":170},{"type":"sum","count":17}] |
| Optimization problem | YES |
| Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 25<instantiation> <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] x[12] x[13] x[14] x[15] x[16] x[17] 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[0][12] y[0][13] y[0][14] y[0][15] y[0][16] 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[1][12] y[1][13] y[1][14] y[1][15] 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[2][12] y[2][13] y[2][14] 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[3][12] y[3][13] 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[4][12] 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[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[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[9][0] y[9][1] y[9][2] y[9][3] y[9][4] y[9][5] y[9][6] y[9][7] y[10][0] y[10][1] y[10][2] y[10][3] y[10][4] y[10][5] y[10][6] y[11][0] y[11][1] y[11][2] y[11][3] y[11][4] y[11][5] y[12][0] y[12][1] y[12][2] y[12][3] y[12][4] y[13][0] y[13][1] y[13][2] y[13][3] y[14][0] y[14][1] y[14][2] y[15][0] y[15][1] y[16][0] c[0] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] c[10] c[11] c[12] c[13] c[14] c[15] c[16] s[0] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] s[10] s[11] s[12] s[13] s[14] s[15] s[16] </list> <values>1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 -2 1 -2 1 -2 -1 -2 1 0 -1 0 1 0 1 0 -1 1 4 1 4 1 4 1 4 1 0 1 0 1 0 1 0 1 </values> </instantiation>