The best known lower bound is S(6)>=536, coming from an explicit 6-color partition [1, 536] of with no monochromatic solution to x + y = z (Fredricksen & Sweet, 2000).

Should have looked for a more rigorous lower bound before posting

combinatorics explode

Someones been watching Numberphile.

We need to bring back higher/lower markets