gpd-evolve-invariant

To automate candidate invariant search for executable theorem artifacts, run the Skill against your target file like 'theorem_artifact.txt'. It systematically analyzes the mathematical expressions to identify potential invariants without manual inspection.

Generating Lyapunov functions for stability analysis using Rust is supported by this Skill. It requires the Rust environment and associated theorem-proving tools to execute the generation process over your executable artifacts.

The best way to find counterexamples in mathematical theorem exploration is to automate the search over executable artifacts. This Skill systematically probes the theorem's boundaries to discover counterexamples that challenge or invalidate existing conjectures.

Yes, you need Rust and associated theorem-proving tools installed to run recurrence detection. The Skill depends on the Rust environment to execute the scripts required for finding recurring patterns in mathematical expressions.

Counterexample discovery works by systematically searching executable theorem artifacts for inputs or conditions that violate the theorem's constraints. This Skill automates that search, generating counterexamples to test the validity and scope of mathematical conjectures.