| Name | LowAutocorrelation/ LowAutocorrelation-026_c18.xml |
| MD5SUM | 4805ee3407b1bb595f0e8cbeb6f1f78a |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 45 |
| Best CPU time to get the best result obtained on this benchmark | 341.811 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 701 |
| Number of constraints | 375 |
| Number of domains | 51 |
| Minimum domain size | 2 |
| Maximum domain size | 51 |
| Distribution of domain sizes | [{"size":2,"count":352},{"size":3,"count":2},{"size":4,"count":1},{"size":5,"count":2},{"size":6,"count":1},{"size":7,"count":2},{"size":8,"count":1},{"size":9,"count":2},{"size":10,"count":1},{"size":11,"count":2},{"size":12,"count":1},{"size":13,"count":2},{"size":14,"count":1},{"size":15,"count":2},{"size":16,"count":1},{"size":17,"count":2},{"size":18,"count":1},{"size":19,"count":2},{"size":20,"count":1},{"size":21,"count":2},{"size":22,"count":1},{"size":23,"count":2},{"size":24,"count":1},{"size":25,"count":2},{"size":26,"count":1},{"size":27,"count":1},{"size":29,"count":1},{"size":31,"count":1},{"size":33,"count":1},{"size":35,"count":1},{"size":37,"count":1},{"size":39,"count":1},{"size":41,"count":1},{"size":43,"count":1},{"size":45,"count":1},{"size":47,"count":1},{"size":49,"count":1},{"size":51,"count":1}] |
| Minimum variable degree | 0 |
| Maximum variable degree | 25 |
| Distribution of variable degrees | [{"degree":0,"count":300},{"degree":2,"count":375},{"degree":25,"count":26}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 26 |
| Distribution of constraint arities | [{"arity":2,"count":26},{"arity":3,"count":326},{"arity":4,"count":1},{"arity":5,"count":1},{"arity":6,"count":1},{"arity":7,"count":1},{"arity":8,"count":1},{"arity":9,"count":1},{"arity":10,"count":1},{"arity":11,"count":1},{"arity":12,"count":1},{"arity":13,"count":1},{"arity":14,"count":1},{"arity":15,"count":1},{"arity":16,"count":1},{"arity":17,"count":1},{"arity":18,"count":1},{"arity":19,"count":1},{"arity":20,"count":1},{"arity":21,"count":1},{"arity":22,"count":1},{"arity":23,"count":1},{"arity":24,"count":1},{"arity":25,"count":1},{"arity":26,"count":1}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 350 |
| Distribution of constraint types | [{"type":"intension","count":350},{"type":"sum","count":25}] |
| 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: 45<instantiation> <list> s[] c[] y[][] x[] </list> <values> 1 4 1 4 9 0 1 0 1 0 1 0 1 4 1 4 1 4 1 4 1 0 1 0 1 -1 2 -1 -2 3 0 1 0 -1 0 -1 0 -1 2 -1 2 -1 -2 1 -2 -1 0 -1 0 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 </values> </instantiation>