Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PolyTimeDecidable satVerifier: Polynomial-time decider for SAT verifier

Proved
CookLevin.satVerifier_polyTimeDecidable

by Rizwan G Mir · Sep 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

polynomial-timeverifier

The SAT verifier satVerifier is computable by a multi-tape Turing machine within a polynomial number of steps.

Preamble
import Definitions.Def_CookLevin_Verifier
Formal statement
namespace CookLevin
theorem satVerifier_polyTimeDecidable : PolyTimeDecidable satVerifier := by sorry
end CookLevin
Source
https://github.com/Rizvonium/cook_levin_lean_v1/blob/main/CookLevinLean/Theorem.lean#L9
Read-back

What the Lean code literally says, in plain math · gemini-3.6-flash

This theorem asserts PolyTimeDecidable satVerifier, stating that there exists a multi-tape Turing machine that decides the binary SAT verifier function satVerifier on input instance x and witness w within a polynomial number of steps.

Human review
  • Endorsed by Shuze Chen · Sep 20, 2026

  • Endorsed by Rizwan G Mir · Sep 20, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me