| Name | StillLife/StillLife-m1-s1/ StillLife-03-05.xml |
| MD5SUM | 32500dad091342bc2572e78f81e7a2ec |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 8 |
| Best CPU time to get the best result obtained on this benchmark | 0.0071979999 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 30 |
| Number of constraints | 38 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":2,"count":15},{"size":9,"count":15}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":2,"count":15},{"degree":7,"count":4},{"degree":8,"count":8},{"degree":10,"count":3}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":2,"count":15},{"arity":3,"count":8},{"arity":4,"count":4},{"arity":6,"count":8},{"arity":9,"count":3}] |
| Number of extensional constraints | 23 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":23},{"type":"sum","count":15}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267179 | OPT | 8 | 0.0071979999 | 0.0087211197 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251556 | OPT | 8 | 0.007374 | 0.00838793 |
| Naxos 1.1.0 (complete) | 4251557 | OPT | 8 | 0.008186 | 0.00870592 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259998 | OPT | 8 | 0.0090300003 | 0.113582 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 8<instantiation type='solution' cost='8'> <list>s[0][0] s[0][1] s[0][2] s[0][3] s[0][4] s[1][0] s[1][1] s[1][2] s[1][3] s[1][4] s[2][0] s[2][1] s[2][2] s[2][3] s[2][4] x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] </list> <values>3 3 4 3 3 3 3 4 3 3 2 2 2 2 2 1 1 0 1 1 1 1 0 1 1 0 0 0 0 0 </values> </instantiation>