| Name | Tpp/Tpp-zinc-s1/ Tpp-4-3-20-1.xml |
| MD5SUM | 442eed38f7ecd1daccab0a66e5b4cbca |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 126 |
| Best CPU time to get the best result obtained on this benchmark | 0.111983 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 64 |
| Number of constraints | 274 |
| Number of domains | 34 |
| Minimum domain size | 3 |
| Maximum domain size | 12 |
| Distribution of domain sizes | [{"size":3,"count":4},{"size":4,"count":7},{"size":5,"count":1},{"size":7,"count":2},{"size":8,"count":6},{"size":9,"count":6},{"size":10,"count":5},{"size":11,"count":21},{"size":12,"count":12}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 23 |
| Distribution of variable degrees | [{"degree":2,"count":32},{"degree":13,"count":20},{"degree":22,"count":11},{"degree":23,"count":1}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 12 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":272},{"arity":12,"count":1}] |
| Number of extensional constraints | 32 |
| Number of intensional constraints | 241 |
| Distribution of constraint types | [{"type":"extension","count":32},{"type":"intension","count":241},{"type":"circuit","count":1}] |
| 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: 126<instantiation type='solution' cost='126'> <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[1] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] l[0] l[10] l[11] l[12] l[13] l[14] l[15] l[16] l[17] l[18] l[19] l[1] l[2] l[3] l[4] l[5] l[6] l[7] l[8] l[9] s[0] s[10] s[11] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>2 4 5 9 3 3 8 8 1 3 1 6 2 2 2 7 1 1 2 7 0 3 7 0 7 9 0 0 3 20 0 0 6 6 3 3 10 7 3 3 7 6 2 3 3 3 2 10 7 7 2 7 0 6 10 1 3 7 4 5 2 11 8 9 </values> </instantiation>