| Name | StillLife/StillLife-m1-s1/ StillLife-06-13.xml |
| MD5SUM | 1997324ae6d797082bd494fdd449159c |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 40 |
| Best CPU time to get the best result obtained on this benchmark | 2400 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 156 |
| Number of constraints | 186 |
| Number of domains | 2 |
| Minimum domain size | 2 |
| Maximum domain size | 9 |
| Distribution of domain sizes | [{"size":2,"count":78},{"size":9,"count":78}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 10 |
| Distribution of variable degrees | [{"degree":2,"count":78},{"degree":7,"count":4},{"degree":8,"count":30},{"degree":10,"count":44}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 9 |
| Distribution of constraint arities | [{"arity":2,"count":78},{"arity":3,"count":30},{"arity":4,"count":4},{"arity":6,"count":30},{"arity":9,"count":44}] |
| Number of extensional constraints | 108 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"extension","count":108},{"type":"sum","count":78}] |
| Optimization problem | YES |
| Type of objective | max SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.12 (complete) | 4267185 | SAT (TO) | 40 | 2400 | 2400.1101 |
| cosoco-mini 1.1 (2017-07-29) (complete) | 4260004 | SAT (TO) | 40 | 2400.1001 | 2400.3101 |
| Naxos 1.1.0 (complete) | 4251559 | SAT (TO) | 39 | 2400.01 | 2400.1 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4251558 | ? (TO) | 2400.1 | 2400.31 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 40<instantiation type='solution' cost='40'> <list>s[0][0] s[0][10] s[0][11] s[0][12] s[0][1] s[0][2] s[0][3] s[0][4] s[0][5] s[0][6] s[0][7] s[0][8] s[0][9] s[1][0] s[1][10] s[1][11] s[1][12] s[1][1] s[1][2] s[1][3] s[1][4] s[1][5] s[1][6] s[1][7] s[1][8] s[1][9] s[2][0] s[2][10] s[2][11] s[2][12] s[2][1] s[2][2] s[2][3] s[2][4] s[2][5] s[2][6] s[2][7] s[2][8] s[2][9] s[3][0] s[3][10] s[3][11] s[3][12] s[3][1] s[3][2] s[3][3] s[3][4] s[3][5] s[3][6] s[3][7] s[3][8] s[3][9] s[4][0] s[4][10] s[4][11] s[4][12] s[4][1] s[4][2] s[4][3] s[4][4] s[4][5] s[4][6] s[4][7] s[4][8] s[4][9] s[5][0] s[5][10] s[5][11] s[5][12] s[5][1] s[5][2] s[5][3] s[5][4] s[5][5] s[5][6] s[5][7] s[5][8] s[5][9] x[0][0] x[0][10] x[0][11] x[0][12] x[0][1] x[0][2] x[0][3] x[0][4] x[0][5] x[0][6] x[0][7] x[0][8] x[0][9] x[1][0] x[1][10] x[1][11] x[1][12] x[1][1] x[1][2] x[1][3] x[1][4] x[1][5] x[1][6] x[1][7] x[1][8] x[1][9] x[2][0] x[2][10] x[2][11] x[2][12] x[2][1] x[2][2] x[2][3] x[2][4] x[2][5] x[2][6] x[2][7] x[2][8] x[2][9] x[3][0] x[3][10] x[3][11] x[3][12] x[3][1] x[3][2] x[3][3] x[3][4] x[3][5] x[3][6] x[3][7] x[3][8] x[3][9] x[4][0] x[4][10] x[4][11] x[4][12] x[4][1] x[4][2] x[4][3] x[4][4] x[4][5] x[4][6] x[4][7] x[4][8] x[4][9] x[5][0] x[5][10] x[5][11] x[5][12] x[5][1] x[5][2] x[5][3] x[5][4] x[5][5] x[5][6] x[5][7] x[5][8] x[5][9] </list> <values>3 4 3 2 3 4 3 3 4 2 3 4 3 3 3 4 2 3 4 3 3 5 3 5 3 3 4 5 4 2 5 5 4 4 5 3 5 4 6 2 2 2 2 3 3 2 4 3 3 4 2 3 3 4 5 3 6 6 3 4 3 5 5 3 4 2 1 2 2 2 2 2 2 2 2 2 2 1 1 0 1 1 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 1 0 1 1 0 0 0 0 0 0 0 0 0 1 0 0 0 1 1 1 0 1 1 1 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 0 0 1 0 0 0 1 1 1 1 0 0 0 1 1 0 0 </values> </instantiation>