The Wolfram S Combinator Challenge

S combinator always duplicates its last parameter, never deletes it. That's why K is needed for universality.

This can be proved by induction. Or you can cite Craig's theorem (the less known one) for that. See [1]

Honestly, I don't see the endgame here.

[1] https://math.stackexchange.com/questions/839926/is-there-a-p...

Barendregt & Manzonetto's 2022 "A lambda calculus satellite" has a whole chapter on the S fragment, for those interested

Wait wouldn't this revolutionize computing? Seems like a rather low bounty for such a monumental proof

I think that website cost more than the listed prize amount.

More wolf-slop.