Definition
Plain language
When an AI prover, asked to prove a step, instead proves it's false — which is a useful, definitive kind of failure.
As stated in the literature
In Goedel-Architect, the diagnosis flavor where the prover produces a compiler-verified counterexample to a candidate sub-lemma, marking that node dead and feeding a structured fix (often an added hypothesis) into the next blueprint revision.
Why it matters: A definitive 'this is false' result usefully closes off a dead end and points the next attempt toward fixing the flawed assumption.
For example, asked to prove a step that turns out to be false, the prover instead produces a concrete counterexample showing it can't be true.
Heard on the show
“The first one — they call it the negation channel — fires when the prover, instead of proving your lemma, manages to prove the *opposite*.”Episode 117 — How an Open AI System Verified 672 Hard Math Proofs for Under $300