| Name | StillLife/StillLife-m1-s1/ StillLife-04-05.xml |
| MD5SUM | 0116bae2a95e7b115a3e9036ad78d6b8 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 12 |
| Best CPU time to get the best result obtained on this benchmark | 0.012825 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 40 |
| Number of constraints | 50 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":2,"count":20},{"size":9,"count":20}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":2,"count":20},{"degree":7,"count":4},{"degree":8,"count":10},{"degree":10,"count":6}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":2,"count":20},{"arity":3,"count":10},{"arity":4,"count":4},{"arity":6,"count":10},{"arity":9,"count":6}] |
| Number of extensional constraints | 30 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":30},{"type":"sum","count":20}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251578 | OPT | 12 | 0.012825 | 0.013191 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260002 | OPT | 12 | 0.013683 | 0.072215997 |
| cosoco-mini 1.12 (complete) | 4267183 | OPT | 12 | 0.01383 | 0.101525 |
| Naxos 1.1.0 (complete) | 4251579 | OPT | 12 | 0.017955 | 0.0182 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 12<instantiation type='solution' cost='12'> <list>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] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] 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] s[3][0] s[3][1] s[3][2] s[3][3] s[3][4] </list> <values>1 1 0 1 1 0 1 0 1 0 1 0 0 0 1 1 1 0 1 1 2 2 4 2 2 4 3 4 3 4 3 4 4 4 3 2 2 2 2 2 </values> </instantiation>