| Name | OpenStacks/OpenStacks-m2c-s1/ OpenStacks-m2c-wbp-10-20-1.xml |
| MD5SUM | 9259b7dd3f7335d1c64b8332bd6645a5 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 6 |
| Best CPU time to get the best result obtained on this benchmark | 39.636799 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 260 |
| Number of constraints | 241 |
| Number of domains | 3 |
| Minimum domain size | 2 |
| Maximum domain size | 21 |
| Distribution of domain sizes | [{"size":2,"count":200},{"size":20,"count":40},{"size":21,"count":20}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 21 |
| Distribution of variable degrees | [{"degree":2,"count":220},{"degree":3,"count":6},{"degree":5,"count":10},{"degree":7,"count":2},{"degree":9,"count":2},{"degree":21,"count":20}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 20 |
| Distribution of constraint arities | [{"arity":3,"count":200},{"arity":5,"count":20},{"arity":11,"count":20},{"arity":20,"count":1}] |
| Number of extensional constraints | 200 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":200},{"type":"allDifferent","count":1},{"type":"sum","count":20},{"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: 6<instantiation id='sol4' type='solution' cost='6'> <list> p[] min[] max[] o[][] so[] </list> <values> 14 2 18 8 11 17 3 19 9 6 1 4 7 13 12 10 16 0 15 5 9 6 11 5 0 1 0 2 13 0 18 15 17 12 3 8 19 13 19 10 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 0 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 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 3 4 5 5 4 5 6 6 6 6 6 6 6 6 5 5 4 4 3 2 </values> </instantiation>