Name | LowAutocorrelation/LowAutocorrelation-m1-s1/ LowAutocorrelation-004.xml |
MD5SUM | b220eda080bc853662ea3d9fecf431a6 |
Bench Category | COP (optimization problem) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 2 |
Best CPU time to get the best result obtained on this benchmark | 0.014214 |
Satisfiable | |
(Un)Satisfiability was proved | |
Number of variables | 19 |
Number of constraints | 12 |
Number of domains | 7 |
Minimum domain size | 2 |
Maximum domain size | 7 |
Distribution of domain sizes | [{"size":2,"count":11},{"size":3,"count":2},{"size":4,"count":1},{"size":5,"count":1},{"size":7,"count":1}] |
Minimum variable degree | 0 |
Maximum variable degree | 3 |
Distribution of variable degrees | [{"degree":0,"count":3},{"degree":2,"count":12},{"degree":3,"count":4}] |
Minimum constraint arity | 2 |
Maximum constraint arity | 4 |
Distribution of constraint arities | [{"arity":2,"count":4},{"arity":3,"count":7},{"arity":4,"count":1}] |
Number of extensional constraints | 0 |
Number of intensional constraints | 9 |
Distribution of constraint types | [{"type":"intension","count":9},{"type":"sum","count":3}] |
Optimization problem | YES |
Type of objective | min SUM |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 2<instantiation type='solution' cost='-2'> <list>c[0] c[1] c[2] s[0] s[1] s[2] x[0] x[1] x[2] x[3] y[0][0] y[0][1] y[0][2] y[1][0] y[1][1] y[1][2] y[2][0] y[2][1] y[2][2] </list> <values>1 0 -1 1 0 1 -1 -1 -1 1 1 1 -1 1 -1 * -1 * * </values> </instantiation>