| Name | Tpp/Tpp-zinc-s1/ Tpp-6-5-20-1.xml |
| MD5SUM | 3ec6160036052286f30104bba84c59a2 |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 102 |
| Best CPU time to get the best result obtained on this benchmark | 0.555451 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 100 |
| Number of constraints | 652 |
| Number of domains | 52 |
| Minimum domain size | 2 |
| Maximum domain size | 30 |
| Distribution of domain sizes | [{"size":2,"count":1},{"size":3,"count":6},{"size":4,"count":14},{"size":5,"count":9},{"size":13,"count":3},{"size":14,"count":3},{"size":15,"count":4},{"size":16,"count":2},{"size":17,"count":5},{"size":18,"count":2},{"size":19,"count":1},{"size":29,"count":20},{"size":30,"count":30}] |
| Minimum variable degree | 2 |
| Maximum variable degree | 31 |
| Distribution of variable degrees | [{"degree":2,"count":50},{"degree":22,"count":29},{"degree":23,"count":1},{"degree":31,"count":20}] |
| Minimum constraint arity | 1 |
| Maximum constraint arity | 30 |
| Distribution of constraint arities | [{"arity":1,"count":1},{"arity":2,"count":650},{"arity":30,"count":1}] |
| Number of extensional constraints | 50 |
| Number of intensional constraints | 601 |
| Distribution of constraint types | [{"type":"extension","count":50},{"type":"intension","count":601},{"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: 102<instantiation type='solution' cost='102'> <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[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[1] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] 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[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[1] s[20] s[21] s[22] s[23] s[24] s[25] s[26] s[27] s[28] s[29] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list> <values>4 5 5 1 4 4 2 1 1 5 4 2 2 3 4 4 4 2 1 4 0 4 1 0 0 0 0 16 5 0 0 0 0 0 8 3 0 0 0 0 1 2 0 0 0 0 0 0 0 0 11 10 23 28 16 11 28 17 17 17 22 10 28 23 22 17 11 16 16 22 0 11 17 12 13 14 15 10 23 18 19 1 20 21 16 29 24 25 26 27 22 28 2 3 4 5 6 7 8 9 </values> </instantiation>