What problem does it solve?
Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial verification that catches the errors self-verification misses. Activates when asked to 'solve this IMO problem', 'prove this olympiad inequality', 'verify this competition proof', 'find a counterexample', or 'is this proof correct', or for any problem with 'IMO', 'Putnam', 'USAMO', 'olympiad', or 'competition math' in it. Uses pure reasoning (no tools) — then a fresh-context adversarial verifier attacks the proof using specific failure patterns, not generic 'check logic'. Outputs calibrated confidence — will say 'no confident solution' rather than bluff. If LaTeX is available, produces a clean PDF after verification passes.
Core Features & Use Cases
- Adversarial verification workflow for Olympiad-style problems (IMO, Putnam, USAMO, AIME) with self-check and fresh-context verifier.
- Generates robust solution with final presentation in LaTeX/PDF when possible.
- No external tools; strict no-web policy; outputs either VERIFIED solution or "no confident solution" with partial notes.
Quick Start
Prompt the system with a complete problem statement and request to solve; it will return a fully verified solution, including a PDF if LaTeX is available.