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