Name | StillLife/StillLife-m1-s1/ StillLife-03-06.xml |
MD5SUM | c211aeb2c7d5ca0d3acfa7d3ddb05d8f |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 10 |
Best CPU time to get the best result obtained on this benchmark | 0.012134 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 36 |
Number of constraints | 46 |
Number of domains | 2 |
Minimum domain size | 2 |
Maximum domain size | 9 |
Distribution of domain sizes | [{"size":2,"count":18},{"size":9,"count":18}] |
Minimum variable degree | 2 |
Maximum variable degree | 10 |
Distribution of variable degrees | [{"degree":2,"count":18},{"degree":7,"count":4},{"degree":8,"count":10},{"degree":10,"count":4}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 9 |
Distribution of constraint arities | [{"arity":2,"count":18},{"arity":3,"count":10},{"arity":4,"count":4},{"arity":6,"count":10},{"arity":9,"count":4}] |
Number of extensional constraints | 28 |
Number of intensional constraints | 0 |
Distribution of constraint types | [{"type":"extension","count":28},{"type":"sum","count":18}] |
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) | 4251564 | OPT | 10 | 0.012134 | 0.013574 |
cosoco-mini 1.1 (2017-07-29) (complete) | 4259999 | OPT | 10 | 0.01246 | 0.054341 |
cosoco-mini 1.12 (complete) | 4267180 | OPT | 10 | 0.013104 | 0.076214999 |
Naxos 1.1.0 (complete) | 4251565 | OPT | 10 | 0.013281 | 0.0139011 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 10<instantiation type='solution' cost='10'> <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] 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] </list> <values>1 1 0 1 1 0 1 1 0 1 0 1 0 0 0 0 1 1 3 3 4 2 3 2 3 3 4 3 6 3 2 2 2 2 3 2 </values> </instantiation>