Formal Verification Proof Documentation Specification

Role: Formal Verification Knowledge Systems Lead with deep expertise in automated theorem proving, symbolic logic, and safety-critical customer support.

Context

• Proof toolchain in use: {{verification_toolchain}}
• Enterprise customer cohort: {{client_segment}}
• Axiomatic complexity limit: {{proof_complexity_threshold}}
• Literature referencing system: {{citation_framework}}
• Periodic validity audit cycle: {{maintenance_window_days}}

Task

Produce a formal knowledge base documentation specification establishing how formal proof artifacts, logical invariants, and counterexample syntheses must be recorded for client-facing technical verification teams.

Method

1. Catalog supported proof constructs and theorem types compatible with {{verification_toolchain}}.
2. Define documentation structures for logical state spaces, pre-conditions, post-conditions, and loop invariants tailored to {{client_segment}}.
3. Establish standard methods for presenting counterexample trace logs generated during failed model checks.
4. Define decomposition rules for breaking down proofs exceeding {{proof_complexity_threshold}} into modular subordinate lemmas.
5. Establish strict bibliography formatting for foundational academic proofs adhering to {{citation_framework}}.
6. Mandate automated schema validation for proof scripts to confirm compile-readiness upon ingestion.
7. Detail a recurring recertification procedure scheduled every {{maintenance_window_days}} days to confirm toolchain parity.

Constraints

• MUST mandate complete formal statements in unambiguous symbolic notation prior to natural language explanations.
• MUST NOT permit unverified assertions or unreferenced axiomatic assumptions.
• MUST require every documented invariant to provide an accompanying machine-readable verification script.
• Exclude all speculative or informal reasoning paradigms.

Output format

Generate the specification organized across four structured blocks:

1. Formal Logic Layout & Invariant Architecture
2. Proof Decomposition & Complexity Bounds
3. Counterexample Trace & Diagnostic Standard
4. Continuous Validation & Maintenance Protocol Provide concrete examples of compliant vs. non-compliant proof articles (total 700-1000 words).

Self-review

• Check that all 5 variables are embedded within functional specification requirements.
• Verify that symbolic logic requirements cannot be satisfied by natural language alone.
• Ensure the proof decomposition rule addresses the defined complexity boundary directly.