| Name | OpenStacks/OpenStacks-m1c-s1/ OpenStacks-m1c-pb-20-10-1.xml |
| MD5SUM | ff1bc4a34c66e5e56c53f1f89f42a15d |
| 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 | 20.1085 |
| 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) | 4407868 | OPT | 9 | 20.1085 | 20.1135 |
| cosoco 2 (complete) | 4394813 | OPT | 9 | 1708.88 | 1708.93 |
| cosoco 2.0 (complete) | 4397482 | OPT | 9 | 1731.21 | 1731.36 |
| cosoco 2.0 (complete) | 4408742 | OPT | 9 | 1937.96 | 1938.07 |
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> 4 8 7 2 1 3 5 0 6 9 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 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 1 0 0 1 1 1 1 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 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 6 6 7 8 6 7 9 9 7 4 0 0 0 0 0 0 0 0 0 1 0 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 3 4 4 1 2 3 3 3 4 4 5 6 6 0 0 0 0 0 0 0 1 1 1 1 1 1 2 2 2 2 2 2 2 0 0 0 1 1 2 2 3 3 3 0 0 0 1 1 1 2 2 2 2 0 0 0 0 0 0 1 1 2 3 1 2 2 2 2 2 2 2 2 3 0 0 1 1 1 1 1 1 1 1 0 0 1 2 2 2 2 2 2 2 0 0 0 0 0 0 1 1 1 1 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 2 0 0 0 0 0 0 0 1 2 2 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 0 0 0 0 0 1 2 3 4 4 0 0 0 1 2 2 3 3 3 3 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 1 1 1 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 1 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 0 1 0 0 0 </values> </instantiation>