conjecture-testing

To automate counterexample search for a mathematical conjecture, this Skill computationally tests hypotheses by searching for counterexamples, verifying small cases, and constructing proofs or refutations. Simply provide the conjecture in the 'conjecture.md' file and run the Skill.

The best way to verify small cases of a theorem computationally is using automated conjecture testing, which systematically checks mathematical hypotheses to determine if they hold or fail. The Skill implements techniques from Woodruff et al. (2026) and Aletheia for this purpose.

Yes, you can use automated hypothesis testing to prove or refute academic theorems. The Skill attempts to construct formal proofs or refutations for proposed conjectures, streamlining academic research and theorem verification workflows.

No specific dependencies or external frameworks are required to start conjecture testing. The Skill operates independently using its internal scripts, requiring only that you define your mathematical conjecture in the 'conjecture.md' file before execution.

You need to run automated proof verification during academic research when a new mathematical conjecture is proposed or when testing whether an existing theorem generalizes to broader cases. It streamlines hypothesis testing by computationally searching for counterexamples.