| Name | Opd/Opd-sum-small/ Opd-09-024-008.xml |
| MD5SUM | 0092e4980ed4af349e39cdcd3a0de294 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 2 |
| Best CPU time to get the best result obtained on this benchmark | 2.49365 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 217 |
| Number of constraints | 46 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 23 |
| Distribution of domain sizes | [{"size":2,"count":216},{"size":23,"count":1}] |
| Minimum variable degree | 10 |
| Maximum variable degree | 37 |
| Distribution of variable degrees | [{"degree":10,"count":216},{"degree":37,"count":1}] |
| Minimum constraint arity | 24 |
| Maximum constraint arity | 216 |
| Distribution of constraint arities | [{"arity":24,"count":9},{"arity":49,"count":36},{"arity":216,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"lex","count":1},{"type":"sum","count":45}] |
| Optimization problem | YES |
| Type of objective | min VAR |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 2<instantiation> <list>z 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[0][12] x[0][13] x[0][14] x[0][15] x[0][16] x[0][17] x[0][18] x[0][19] x[0][20] x[0][21] x[0][22] x[0][23] 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[1][12] x[1][13] x[1][14] x[1][15] x[1][16] x[1][17] x[1][18] x[1][19] x[1][20] x[1][21] x[1][22] x[1][23] 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[2][12] x[2][13] x[2][14] x[2][15] x[2][16] x[2][17] x[2][18] x[2][19] x[2][20] x[2][21] x[2][22] x[2][23] 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[3][12] x[3][13] x[3][14] x[3][15] x[3][16] x[3][17] x[3][18] x[3][19] x[3][20] x[3][21] x[3][22] x[3][23] 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[4][12] x[4][13] x[4][14] x[4][15] x[4][16] x[4][17] x[4][18] x[4][19] x[4][20] x[4][21] x[4][22] x[4][23] 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[5][12] x[5][13] x[5][14] x[5][15] x[5][16] x[5][17] x[5][18] x[5][19] x[5][20] x[5][21] x[5][22] x[5][23] 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[6][12] x[6][13] x[6][14] x[6][15] x[6][16] x[6][17] x[6][18] x[6][19] x[6][20] x[6][21] x[6][22] x[6][23] 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[7][12] x[7][13] x[7][14] x[7][15] x[7][16] x[7][17] x[7][18] x[7][19] x[7][20] x[7][21] x[7][22] x[7][23] 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[8][12] x[8][13] x[8][14] x[8][15] x[8][16] x[8][17] x[8][18] x[8][19] x[8][20] x[8][21] x[8][22] x[8][23] </list> <values>2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 1 1 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 1 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 1 0 0 0 1 0 1 1 1 0 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 0 0 1 1 0 1 0 0 1 1 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 1 1 1 0 1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 1 0 </values> </instantiation>