| Name | OpenStacks/OpenStacks-m1c-s1/ OpenStacks-m1c-wbo-10-20-1.xml |
| MD5SUM | d7c471897aabf9bcf88e3289701225f5 |
| 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 | 37.4571 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 640 |
| Number of constraints | 621 |
| Number of domains | 6 |
| Minimum domain size | 2 |
| Maximum domain size | 21 |
| Distribution of domain sizes | [{"size":2,"count":420},{"size":4,"count":20},{"size":5,"count":140},{"size":9,"count":20},{"size":20,"count":20},{"size":21,"count":20}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 11 |
| Distribution of variable degrees | [{"degree":2,"count":230},{"degree":3,"count":390},{"degree":11,"count":20}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 20 |
| Distribution of constraint arities | [{"arity":2,"count":210},{"arity":3,"count":390},{"arity":11,"count":20},{"arity":20,"count":1}] |
| 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":20},{"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) | 4407869 | OPT | 5 | 37.4571 | 37.4542 |
| cosoco 2.0 (complete) | 4397621 | SAT (TO) | 6 | 2400.04 | 2400.2 |
| cosoco 2.0 (complete) | 4408881 | SAT (TO) | 6 | 2400.08 | 2400.11 |
| cosoco 2 (complete) | 4394814 | SAT (TO) | 6 | 2400.1 | 2400.01 |
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> o[][] so[] np[][] r[][] p[] </list> <values> 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 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 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 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 0 1 1 1 1 1 1 1 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 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 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 2 3 4 5 5 5 5 4 4 5 5 5 5 5 5 4 4 4 4 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 2 2 3 4 4 0 0 1 2 2 2 2 2 3 3 4 4 4 4 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 1 1 2 3 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 2 2 3 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 1 1 1 1 1 1 2 3 3 3 4 0 1 1 1 1 1 1 2 3 4 4 4 4 4 4 4 4 4 4 4 1 1 1 1 2 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 0 1 2 2 3 3 4 4 4 4 4 5 6 6 6 6 7 7 8 8 0 0 0 1 1 2 2 3 3 3 3 3 3 4 4 4 4 4 4 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 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 0 0 0 0 0 1 1 0 0 1 0 1 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 16 11 8 10 6 2 17 15 0 5 14 7 18 12 13 9 3 19 1 4 </values> </instantiation>