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