| Name | Ramsey/Ramsey-int-s1/ Ramsey-int-14.xml |
| MD5SUM | f410f04816b97be6981931cb2af07a5b |
| 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 | 0.441248 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 196 |
| Number of constraints | 364 |
| Number of domains | 1 |
| Minimum domain size | 91 |
| Maximum domain size | 91 |
| Distribution of domain sizes | [{"size":91,"count":91}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 13 |
| Distribution of variable degrees | [{"degree":0,"count":105},{"degree":13,"count":91}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 3 |
| Distribution of constraint arities | [{"arity":3,"count":364}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 364 |
| Distribution of constraint types | [{"type":"intension","count":364}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
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 type='solution' cost='2'> <list>x[0][0] x[0][10] x[0][11] x[0][12] x[0][13] 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[10][0] x[10][10] x[10][11] x[10][12] x[10][13] 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[11][0] x[11][10] x[11][11] x[11][12] x[11][13] 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[12][0] x[12][10] x[12][11] x[12][12] x[12][13] x[12][1] x[12][2] x[12][3] x[12][4] x[12][5] x[12][6] x[12][7] x[12][8] x[12][9] x[13][0] x[13][10] x[13][11] x[13][12] x[13][13] x[13][1] x[13][2] x[13][3] x[13][4] x[13][5] x[13][6] x[13][7] x[13][8] x[13][9] x[1][0] x[1][10] x[1][11] x[1][12] x[1][13] 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[2][0] x[2][10] x[2][11] x[2][12] x[2][13] 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[3][0] x[3][10] x[3][11] x[3][12] x[3][13] 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[4][0] x[4][10] x[4][11] x[4][12] x[4][13] 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[5][0] x[5][10] x[5][11] x[5][12] x[5][13] 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[6][0] x[6][10] x[6][11] x[6][12] x[6][13] 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[7][0] x[7][10] x[7][11] x[7][12] x[7][13] 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[8][0] x[8][10] x[8][11] x[8][12] x[8][13] 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[9][0] x[9][10] x[9][11] x[9][12] x[9][13] 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] </list> <values>* 2 1 0 0 1 0 1 0 2 2 1 0 2 * * 1 1 2 * * * * * * * * * * * * 0 1 * * * * * * * * * * * * * 2 * * * * * * * * * * * * * * * * * * * * * * * * 0 2 0 2 * 1 2 1 2 1 0 0 2 * 0 1 1 2 * * 0 2 1 0 2 1 2 * 2 0 1 1 * * * 2 1 1 0 0 0 * 0 0 1 1 * * * * 2 2 0 2 1 * 0 0 2 0 * * * * * 0 2 0 1 * 1 2 0 2 * * * * * * 0 1 1 * 2 2 1 0 * * * * * * * 1 1 * 2 2 2 1 * * * * * * * * 2 * 0 1 0 0 * * * * * * * * * </values> </instantiation>