Assume that the groups are interchangeable, so that the division $(A,B),(C,D),(E)$ is the same as the division $(C,D),(A,B),(E)$ and assume that you don't allow empty groups.
The maximal group has to have either $2$ or $3$ members.
Case I: (maximal group has $3$ members). Then the counts must be $\\{3,1,1\\}$ and the division is determined by the members in the group of $3$. Hence there are $$\binom 53=10$$ divisions of this type.
Case II: (maximal group has $2$ members). Then the counts must be $\\{2,2,1\\}$. Then there are $\binom 52=10$ ways to populate one group of two, and then $\binom 32=3$ to populate the other. As switching the two groups of two does not change the division we see that there are $$\frac {10\times 3}2=15$$ divisions of this type.
Combining we see that there are $$10+15=25$$ possible divisions.