| Name | OpenStacks/OpenStacks-m2c-s1/ OpenStacks-m2c-pb-10-10-1.xml |
| MD5SUM | 4153efd907083a776cdbce6b1e04a113 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 5 |
| Best CPU time to get the best result obtained on this benchmark | 0.068030998 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 140 |
| Number of constraints | 131 |
| Number of domains | 3 |
| Minimum domain size | 2 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":2,"count":100},{"size":10,"count":30},{"size":11,"count":10}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":2,"count":110},{"degree":3,"count":1},{"degree":5,"count":5},{"degree":7,"count":2},{"degree":9,"count":2},{"degree":11,"count":20}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 11 |
| Distribution of constraint arities | [{"arity":2,"count":2},{"arity":3,"count":110},{"arity":4,"count":6},{"arity":6,"count":2},{"arity":10,"count":1},{"arity":11,"count":10}] |
| Number of extensional constraints | 100 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":100},{"type":"allDifferent","count":1},{"type":"sum","count":10},{"type":"minimum","count":10},{"type":"maximum","count":10}] |
| 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: 5<instantiation type="optimum" cost="5"> <list> p[0] p[1] p[2] p[3] p[4] p[5] p[6] p[7] p[8] p[9] min[0] min[1] min[2] min[3] min[4] min[5] min[6] min[7] min[8] min[9] max[0] max[1] max[2] max[3] max[4] max[5] max[6] max[7] max[8] max[9] o[0][0] o[0][1] o[0][2] o[0][3] o[0][4] o[0][5] o[0][6] o[0][7] o[0][8] o[0][9] o[1][0] o[1][1] o[1][2] o[1][3] o[1][4] o[1][5] o[1][6] o[1][7] o[1][8] o[1][9] o[2][0] o[2][1] o[2][2] o[2][3] o[2][4] o[2][5] o[2][6] o[2][7] o[2][8] o[2][9] o[3][0] o[3][1] o[3][2] o[3][3] o[3][4] o[3][5] o[3][6] o[3][7] o[3][8] o[3][9] o[4][0] o[4][1] o[4][2] o[4][3] o[4][4] o[4][5] o[4][6] o[4][7] o[4][8] o[4][9] o[5][0] o[5][1] o[5][2] o[5][3] o[5][4] o[5][5] o[5][6] o[5][7] o[5][8] o[5][9] o[6][0] o[6][1] o[6][2] o[6][3] o[6][4] o[6][5] o[6][6] o[6][7] o[6][8] o[6][9] o[7][0] o[7][1] o[7][2] o[7][3] o[7][4] o[7][5] o[7][6] o[7][7] o[7][8] o[7][9] o[8][0] o[8][1] o[8][2] o[8][3] o[8][4] o[8][5] o[8][6] o[8][7] o[8][8] o[8][9] o[9][0] o[9][1] o[9][2] o[9][3] o[9][4] o[9][5] o[9][6] o[9][7] o[9][8] o[9][9] so[0] so[1] so[2] so[3] so[4] so[5] so[6] so[7] so[8] so[9] </list> <values> 5 9 1 4 0 3 6 7 8 2 0 1 2 0 7 0 6 7 4 8 7 3 5 7 8 8 6 9 6 9 1 1 1 1 1 1 1 1 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 1 0 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 3 4 5 5 5 5 5 5 4 2 </values> </instantiation>