[gaigalas]

Wow!

If curl developers are overwhelmed by AI PRs, imagine how mathematicians will feel verifying a huge backlog of automated proofs.

Or isn't there such a thing? Can someone make a very complicated automated proof that ultimately reveals itself to be useless?

[gus_massa]

For math it's easy, everyone just ignore it. There is no Daniel to blame. There are a few post about P=/!=NP or the Riemann conjeture or rewriting physics each week that are posted to HN. I'm just ignoring them. Other mathematicians are just ignoring them. But you will not find anyone to blame.

There are a few "solutions" of conjetures that may be correct, like https://en.wikipedia.org/wiki/Abc_conjecture I'm not sure about the current state. There may be a few mathematicians trying to read some parts, or perhaps no. Perhaps in a few years the easy parts will be refactored and isolated, and published as special cases. And after a while, it may be verified or someone will find a gap and perhaps fix it. Just wait a few decades.

> Can someone make a very complicated automated proof that ultimately reveals itself to be useless?

It depends, on what you consider insightful. Take a look at "Determination of the fifth Busy Beaver value" https://news.ycombinator.com/item?id=45273999 in particular the first comment. Is that an heroic result that opens a lot of paths or a useless combination of tricks that no one will ever understand? (In my opinion a proof is a proof [standing applause emoji].)

[gaigalas]

What I (personally) consider insightful is irrelevant. It's about what mathematicians consider insightful.

Mathematicians are obviously not ignoring automated proofs. Terry's post is an evidence of that.

Consider LK99 instead of crackpot P vs NP proofs. That wasted a lot of academia time.

It seems that it could happen to math.