size 1: [1]  (t=0.0s)
size 2: [1, 2]  (t=0.0s)
size 3: [1, 2, 3]  (t=0.0s)
size 4: [1, 2, 3, 4]  (t=0.0s)
size 5: [1, 2, 3, 4, 5]  (t=0.0s)
size 6: [1, 2, 3, 4, 5, 6]  (t=0.0s)
size 7: [1, 2, 3, 4, 5, 6, 7]  (t=0.0s)
size 8: [1, 2, 3, 4, 5, 6, 7, 8]  (t=0.0s)
size 9: [1, 2, 3, 4, 5, 6, 7, 8, 9]  (t=0.0s)
size 10: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]  (t=0.0s)
size 11: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]  (t=0.0s)
size 12: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]  (t=0.0s)
size 13: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15]  (t=0.0s)
DONE K=5 M=36: max size 13 in 471.4s
  2 sets of size 13; first few: [(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15), (2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 24, 26, 30)]
