| Name | OpenStacks/OpenStacks-m1-s1/ OpenStacks-m1-pb-20-10-1.xml |
| MD5SUM | 6d5ad6e560d8ba4150ae6f3b32071d86 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 9 |
| Best CPU time to get the best result obtained on this benchmark | 18.6586 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 620 |
| Number of constraints | 611 |
| Number of domains | 7 |
| Minimum domain size | 2 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":2,"count":470},{"size":3,"count":60},{"size":4,"count":40},{"size":5,"count":20},{"size":7,"count":10},{"size":10,"count":10},{"size":11,"count":10}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 21 |
| Distribution of variable degrees | [{"degree":2,"count":230},{"degree":3,"count":380},{"degree":21,"count":10}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 21 |
| Distribution of constraint arities | [{"arity":2,"count":220},{"arity":3,"count":380},{"arity":10,"count":1},{"arity":21,"count":10}] |
| Number of extensional constraints | 200 |
| Number of intensional constraints | 200 |
| Distribution of constraint types | [{"type":"extension","count":200},{"type":"intension","count":200},{"type":"allDifferent","count":1},{"type":"sum","count":10},{"type":"element","count":200}] |
| Optimization problem | YES |
| Type of objective | min MAXIMUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407621 | OPT | 9 | 18.6586 | 18.6572 |
| cosoco 2 (complete) | 4394706 | OPT | 9 | 1684.23 | 1684.61 |
| cosoco 2.0 (complete) | 4397495 | OPT | 9 | 1707.29 | 1707.39 |
| cosoco 2.0 (complete) | 4408755 | OPT | 9 | 1762.11 | 1762.09 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 9<instantiation> <list> p[] o[][] so[] np[][] r[][] </list> <values> 8 4 0 3 6 1 9 7 5 2 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 1 1 1 1 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 0 1 1 1 1 1 5 6 9 8 9 8 9 9 8 5 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 3 3 4 4 4 4 4 4 1 2 3 4 5 5 5 6 6 6 0 0 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 2 0 0 1 2 2 2 2 2 2 3 0 0 0 0 0 0 0 0 1 2 0 0 0 0 1 1 2 2 3 3 1 2 2 2 2 2 3 3 3 3 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 1 1 2 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 1 0 0 1 1 1 1 2 2 2 2 0 0 1 1 2 2 2 2 2 2 0 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 0 0 1 2 3 3 3 3 4 4 0 0 0 0 0 1 1 1 2 3 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 1 0 0 0 0 0 1 1 1 1 1 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 1 0 1 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 1 0 0 0 0 0 0 1 0 0 1 1 </values> </instantiation>