| Name | StillLife/StillLife-m1-s1/ StillLife-05-06.xml |
| MD5SUM | 961ba47a71bb5a6b7e86e986065c296e |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 16 |
| Best CPU time to get the best result obtained on this benchmark | 0.144182 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 60 |
| Number of constraints | 74 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":2,"count":30},{"size":9,"count":30}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":2,"count":30},{"degree":7,"count":4},{"degree":8,"count":14},{"degree":10,"count":12}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":2,"count":30},{"arity":3,"count":14},{"arity":4,"count":4},{"arity":6,"count":14},{"arity":9,"count":12}] |
| Number of extensional constraints | 44 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":44},{"type":"sum","count":30}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| Naxos 1.1.0 (complete) | 4251569 | OPT | 16 | 0.144182 | 0.144662 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251568 | OPT | 16 | 0.361363 | 0.363969 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260003 | OPT | 16 | 0.36549801 | 0.412339 |
| cosoco-mini 1.12 (complete) | 4267184 | OPT | 16 | 0.373476 | 0.374787 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 16<instantiation> <list> x[0][0] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[1][0] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[2][0] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[3][0] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[4][0] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] s[0][0] s[0][1] s[0][2] s[0][3] s[0][4] s[0][5] s[1][0] s[1][1] s[1][2] s[1][3] s[1][4] s[1][5] s[2][0] s[2][1] s[2][2] s[2][3] s[2][4] s[2][5] s[3][0] s[3][1] s[3][2] s[3][3] s[3][4] s[3][5] s[4][0] s[4][1] s[4][2] s[4][3] s[4][4] s[4][5] </list> <values> 0 0 1 1 0 1 0 1 0 0 1 1 1 0 1 0 0 0 1 0 1 0 1 1 0 1 1 0 1 1 1 2 2 2 4 2 2 3 4 4 3 2 2 5 2 4 4 4 2 6 3 5 3 3 2 3 2 4 3 3 </values> </instantiation>