from itertools import combinations

def subset(numbers):
    for i in range(len(numbers)):
        combos = list(combinations(numbers , i))
        combos = convert_tuple(combos)
        for i in combos:
            chkzro = sum(i)
            if chkzro == 0 and len(i) > 1:
                print(i , "is a 0 sum subset")
                return True
                break
            else:
                continue
            break


def convert_tuple(tup):
    if type(tup) == list or type(tup) == tuple:
        return [convert_tuple(i) for i in tup]
    return tup


numbers = [[-97162, -95761, -94672, -87254, -57207, -22163, -20207, -1753, 11646, 13652, 14572, 30580, 52502, 64282, 74896, 83730, 89889, 92200] ,
            [-93976, -93807, -64604, -59939, -44394, -36454, -34635, -16483, 267, 3245, 8031, 10622, 44815, 46829, 61689, 65756, 69220, 70121] ,
            [-83964, -81834, -78386, -70497, -69357, -61867, -49127, -47916, -38361, -35772, -29803, -15343, 6918, 19662, 44614, 66049, 93789, 95405] ,
            [-94624, -86776, -85833, -80822, -71902, -54562, -38638, -26483, -20207, -1290, 12414, 12627, 19509, 30894, 32505, 46825, 50321, 69294]]

for i in numbers:
    subset(i)
    if not subset(i):
        print("None found in" , i)