Verify proofs, check theorem correctness, and solve satisfiability problems using Lean 4, Coq, and Z3 SMT solver. Use when the user asks to prove theorems, verify mathematical proofs, check logical satisfiability, or work with proof assistants.
Formal verification tools for the academic workspace. Type-check Lean 4 proofs, verify Coq theories, and solve SMT satisfiability problems with Z3.
prover_status to see which provers are installedlean_check, coq_check, or z3_solve to verifylean_check — Type-check Lean 4 code. Params: code (required), filenamecoq_check — Check a Coq proof. Params: code (required), filenamecoq_compile — Compile Coq to .vo object file. Params: code (required), filenamez3_solve — Solve SMT-LIB2 formula. Params: (required)formulaprover_status — Check available provers and versions. No params.Example:
{ "code": "theorem add_comm (a b : Nat) : a + b = b + a := Nat.add_comm a b" }
See canonical skill for full tool documentation and parameter details.