Devides list in all posible sublists, without repetitions

divide.py

from itertools import combinations

def divide(l, p={}):
    for v in (j for i in xrange(1, len(l) + 1) for j in combinations(l, i)):
        r = tuple(set(l) - set(v))
        for s in devide(r):
            t = (v,) + (s if s else tuple())

            if frozenset(t) in p: continue
            else: yield t; p[frozenset(t)] = True

    if not l: yield tuple()

list(devide([1,2,3,4,5]))