| Name | OpenStacks/OpenStacks-m1c-s1/ OpenStacks-m1c-wbo-30-10-1.xml |
| MD5SUM | dd223f53e99966dd907f4082bd2f0263 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 10 |
| Best CPU time to get the best result obtained on this benchmark | 37.3595 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 920 |
| Number of constraints | 911 |
| Number of domains | 7 |
| Minimum domain size | 2 |
| Maximum domain size | 11 |
| Distribution of domain sizes | [{"size":2,"count":730},{"size":3,"count":100},{"size":4,"count":20},{"size":5,"count":40},{"size":6,"count":10},{"size":10,"count":10},{"size":11,"count":10}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 31 |
| Distribution of variable degrees | [{"degree":2,"count":340},{"degree":3,"count":570},{"degree":31,"count":10}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 31 |
| Distribution of constraint arities | [{"arity":2,"count":330},{"arity":3,"count":570},{"arity":10,"count":1},{"arity":31,"count":10}] |
| Number of extensional constraints | 300 |
| Number of intensional constraints | 300 |
| Distribution of constraint types | [{"type":"extension","count":300},{"type":"intension","count":300},{"type":"allDifferent","count":1},{"type":"sum","count":10},{"type":"element","count":300}] |
| 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) | 4407872 | OPT | 10 | 37.3595 | 37.3651 |
| cosoco 2 (complete) | 4394817 | OPT | 10 | 1084.01 | 1084.1 |
| cosoco 2.0 (complete) | 4397455 | OPT | 10 | 1095.76 | 1095.78 |
| cosoco 2.0 (complete) | 4408715 | OPT | 10 | 1107.92 | 1107.91 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 10<instantiation> <list> np[][] r[][] p[] o[][] so[] </list> <values> 0 1 1 2 3 4 4 4 5 5 1 1 2 2 2 2 2 2 2 2 0 0 0 0 1 1 2 2 2 2 1 1 1 1 1 2 3 3 3 3 0 0 0 0 0 1 1 2 2 2 0 0 1 1 1 1 2 3 3 4 0 0 0 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 1 2 0 0 0 0 0 0 0 0 1 2 0 0 0 0 0 0 0 0 0 1 0 1 2 3 3 3 3 3 4 4 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 1 2 2 2 2 0 0 1 2 2 2 2 2 2 2 0 1 1 2 2 3 3 4 4 4 0 0 0 0 0 0 1 1 2 2 0 1 2 2 2 2 2 2 2 2 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 1 2 3 3 3 3 3 3 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 1 1 1 1 1 2 2 3 4 4 4 0 0 0 0 0 0 0 0 0 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 1 0 0 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 0 2 1 9 0 8 5 6 7 4 3 0 1 1 1 1 1 1 1 1 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 1 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 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 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 6 9 10 9 10 10 10 9 7 6 </values> </instantiation>