Spent 3 months on an Erdős 993 problem with Claude Code + Codex. Found out today a full proof was posted last week.

A developer spent three months using Claude Code and Codex to work on Erdős Problem #993, which concerns the unimodality of the independent-set sequence of trees. However, they discovered that a complete proof for this problem was posted last week by Tong Zhang and Wei Li. Additionally, two Lean 4 formalizations of the proof have already been created, though the proof has not yet been peer-reviewed.

This report highlights how a developer's three-month effort with AI tools on Erdős Problem #993 was preempted by a full proof posted just last week, unlike earlier attempts.