| Name | test/cop/ OpenStacks-m1-pb-10-10-1.xml |
| MD5SUM | 6d608cb246764b26f2fd04eaba1e7ec3 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 5 |
| Best CPU time to get the best result obtained on this benchmark | 5.45062 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | |
| Number of constraints | |
| Number of domains | |
| Minimum domain size | |
| Maximum domain size | |
| Distribution of domain sizes | |
| Minimum variable degree | |
| Maximum variable degree | |
| Distribution of variable degrees | |
| Minimum constraint arity | |
| Maximum constraint arity | |
| Distribution of constraint arities | |
| Number of extensional constraints | |
| Number of intensional constraints | |
| Distribution of constraint types | |
| Optimization problem | YES |
| Type of objective |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| (reference) PicatSAT 2019-09-12 (complete) | 4407522 | OPT | 5 | 5.45062 | 5.47179 |
| cosoco 2.0 (complete) | 4397473 | OPT | 5 | 52.5199 | 52.6034 |
| cosoco 2 (complete) | 4394662 | OPT | 5 | 52.6537 | 52.6623 |
| cosoco 2.0 (complete) | 4408733 | OPT | 5 | 52.9201 | 53.3773 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 5<instantiation> <list> r[][] p[] o[][] so[] np[][] </list> <values> 0 1 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 1 0 1 1 0 0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 0 0 1 1 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 0 0 0 0 0 0 0 1 0 1 1 0 1 0 0 0 0 0 0 0 1 7 8 4 9 2 0 3 5 6 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 1 0 1 1 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 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 2 5 5 3 4 4 4 5 4 4 0 1 1 2 2 2 2 2 2 2 0 0 0 0 1 2 2 2 3 3 0 0 0 0 1 1 2 3 3 3 0 1 1 2 2 3 4 4 4 5 0 1 2 2 2 2 2 2 2 2 0 0 1 2 2 2 2 2 2 3 0 0 0 0 0 0 0 0 0 1 1 2 2 2 2 2 2 2 2 2 0 0 0 0 0 0 0 1 1 2 1 1 2 2 2 2 2 2 2 2 </values> </instantiation>