| Name | OpenStacks/ OpenStacks-m2c-s1/OpenStacks-m2c-Miller-19.xml |
| MD5SUM | ca3b02115b63c058d23855e217e5f7b7 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT TO |
| Best value of the objective obtained on this benchmark | 13 |
| Best CPU time to get the best result obtained on this benchmark | 244.711 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 920 |
| Number of constraints | 881 |
| Number of domains | 3 |
| Minimum domain size | 2 |
| Maximum domain size | 41 |
| Distribution of domain sizes | [{"size":2,"count":800},{"size":40,"count":80},{"size":41,"count":40}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 41 |
| Distribution of variable degrees | [{"degree":2,"count":840},{"degree":9,"count":40},{"degree":41,"count":40}] |
| Minimum constraint arity | 3 |
| Maximum constraint arity | 40 |
| Distribution of constraint arities | [{"arity":3,"count":800},{"arity":9,"count":40},{"arity":21,"count":40},{"arity":40,"count":1}] |
| Number of extensional constraints | 800 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":800},{"type":"allDifferent","count":1},{"type":"sum","count":40},{"type":"minimum","count":20},{"type":"maximum","count":20}] |
| 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: 13<instantiation id='sol5' type='solution' cost='13'> <list> p[] min[] max[] o[][] so[] </list> <values> 10 14 19 23 13 38 33 30 31 27 25 35 34 32 21 17 5 1 7 6 12 15 18 22 24 37 28 39 26 36 29 20 16 0 8 3 11 4 9 2 1 2 6 2 9 2 12 13 18 22 24 20 16 0 8 0 5 0 1 0 12 15 19 23 24 38 38 39 38 39 31 39 35 39 35 36 32 21 17 7 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 0 0 0 0 0 0 0 0 0 0 1 1 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 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 0 0 0 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 1 1 1 1 0 0 0 0 0 0 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 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 1 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 0 0 0 0 1 1 1 1 1 1 1 1 1 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 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 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 1 1 1 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 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 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 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 1 1 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 1 1 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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 1 1 1 1 1 1 1 1 1 1 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 1 1 1 1 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 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 0 0 0 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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 6 9 9 9 10 11 11 11 12 12 12 13 13 13 13 13 13 13 13 13 13 13 13 13 12 12 12 12 12 12 12 11 10 10 10 8 7 7 4 </values> </instantiation>