Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Robson’s native polynomial-time CNF builder on words

Proved
CNFEncComplexity.Robson.robsonBuild_words

by bersubs · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorysatisfiability

For each fixed program length bound there is a native polynomial-time formula generator on serialized words, with the correctness and clause bound of Robson’s theorem.

Preamble
import Definitions.Def_CNFEncComplexity_RobsonMemoryGatePrimitives
import Definitions.Def_CNFEncComplexity_NRAMEvaluates
import Mathlib.Analysis.SpecialFunctions.Log.Base

open CNFEncComplexity CNFEncComplexity.Robson CNFEncComplexity.RobsonCNF Turing.MultiTapeTM
Formal statement
theorem CNFEncComplexity.Robson.robsonBuild_words (P : ℕ) :
    ∃ C : ℕ, ∃ build : List (List Bool) → CookLevin.Formula,
      ComputableTidilyInPolyTime build (encList encBits) unaryFormulaEnc ∧
      ∀ (n t : ℕ) (prog : List Instr) (f : (Fin n → Bool) → Bool),
        prog.length ≤ P → NRAMEvaluates prog t f →
        IsEncoding (build (robsonWords (prog, n, t))) Fin.val f ∧
        ((build (robsonWords (prog, n, t))).length : ℝ) ≤
          (C : ℝ) * ((t : ℝ) + 1) * Real.logb 2 ((t : ℝ) + 2) := by sorry
Source
Krapivin, Przybocki, Subercaseaux, The CNF Encoding Complexity of Boolean Functions, arXiv:2611.05614, Theorem 2, Section 3.2.

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