OpenParable
Skip to content
← Back to skills

Proof Assistant

Testing & Quality
proof-assistant

Proof Assistant is an Agent Skill for testing & quality published in the a5c-ai/babysitter repository on GitHub: a SKILL.md instruction file an AI agent can load to do this task.

Assist in constructing algorithm correctness proofs

View on GitHub ↗
QUICK START

How to use this skill

Bring this guide into your coding agent with a prompt tailored to the tool you use.

  1. Open your project in Codex.
  2. Copy and paste the prompt below.
  3. Review files and risks before approving any action.
Prompt to paste
Inspect the Agent Skill at https://github.com/a5c-ai/babysitter/blob/HEAD/library/specializations/algorithms-optimization/skills/proof-assistant/SKILL.md and all supporting files. Report provenance, permissions, scripts, dependencies, and security risks. Propose an exact installation into .agents/skills/proof-assistant, but wait for my approval before writing files or running scripts.

Copying this prompt does not install or run the skill. Review third-party files before use.

Proof Assistant Skill

Purpose

Assist in constructing formal correctness proofs for algorithms using standard proof techniques.

Capabilities

  • Proof structure templates (induction, contradiction, etc.)
  • Step-by-step proof guidance
  • Termination argument generation
  • Proof review and validation
  • Identify proof gaps

Target Processes

  • correctness-proof-testing
  • algorithm-implementation

Proof Techniques

Mathematical Induction

  • Base case identification
  • Inductive hypothesis formulation
  • Inductive step construction

Proof by Contradiction

  • Assumption negation
  • Logical derivation
  • Contradiction identification

Loop Invariant Proofs

  • Invariant specification
  • Three-part proof (init, maintenance, termination)

Structural Induction

  • For recursive data structures
  • Base case (leaf/empty)
  • Inductive case (composite)

Input Schema

{
  "type": "object",
  "properties": {
    "algorithm": { "type": "string" },
    "code": { "type": "string" },
    "proofType": {
      "type": "string",
      "enum": ["induction", "contradiction", "invariant", "structural"]
    },
    "claim": { "type": "string" },
    "partialProof": { "type": "string" }
  },
  "required": ["algorithm", "claim"]
}

Output Schema

{
  "type": "object",
  "properties": {
    "success": { "type": "boolean" },
    "proof": { "type": "string" },
    "structure": { "type": "array" },
    "gaps": { "type": "array" },
    "suggestions": { "type": "array" }
  },
  "required": ["success"]
}