Finite graph refutation instrument · human + agent
One graph is enough.
A universal claim can survive a thousand examples and still fail once. Assemble the claim, search the declared finite order, and inspect the first graph that ends it.
Put a claim under pressureThe interface shifts weight from for every graph to there exists a graph when the search finds a witness.
Why one witness is enough
A universal statement is false as soon as one object satisfies every premise and violates the conclusion. Finite Witness preserves that object and the exact search prefix that found it.
Every connected, minimum degree at least 2 graph with at least 3 vertices must contain a triangle.
Instrument armed
The claim is intact.
Change a premise or run the ordered search. If the line breaks, the first witness will occupy this field.
Pressure increasing
Enumerating finite worlds
Checking candidate graphs in increasing vertex and edge-mask order...
Universal claim falsified
Four vertices are enough.
Generated after search
No witness through 6 vertices.
The line held inside this finite range. That is evidence, not a mathematical proof.
Feed the witness back
Each repair excludes this witness and rewrites the next universal claim. It remains a hypothesis until the rig runs again.
The reasoning passes through one sheet.
Witness archive
Each filed witness preserves the universal claim it broke, the concrete graph, and the exact finite search record.
No witness filed yet.
Find one above, then preserve its certificate here.State changes
Human actions and WebMCP calls write to the same audit margin.
- Workspace initialized. Waiting for a human or WebMCP call.