return lists that do not share all of the same elements

edit

As usual, Éric is right but delphic (pythic ?)... Try this

L=[]
S=set(L)
for u in (your generator):
    s=set(u)
    if s not in S:
        L.extend(u) ## Maybe L.extend(copy(u)) if sharing structures may be a problem later...
        S.add((s)
L

At the end of execution, L should contain lists differing by at least one element.

Assume that your array of lists is stored in my_lists. Then, the lines

sets = map(set,my_lists)
union(map(tuple,sets))

do the trick. You get a list of tuples whose elements are unique, as wanted. For example, if

my_lists = Permutations([3,1,2]).list() + Permutations([6,5,4]).list()

then the above two lines yield

[(4, 5, 6), (1, 2, 3)]

Use sets, not lists:

sage: set([1, 2, 3, 4])
{1, 2, 3, 4}
sage: set([2, 3, 4, 1])
{1, 2, 3, 4}
sage: set([1, 2, 3, 4]) == set([2, 3, 4, 1])
True