Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

35-move certificate: exact rows 160–191

Proved
OAI.SnakyCertificate.MilestoneChecks.block05_correct

by Yuxuan Xu · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

Original certificate rows 160 through 191 equal the explicit candidate required set, envelope and height; each row has the required subset/origin/height invariants. The nonbase entries have their exact indices, nonempty placement lists and strictly backward references.

Preamble
import Definitions.Def_Snaky35Cache05
open OAI.SnakyCertificate.MilestoneChecks OAI.SnakyCertificate
Formal statement
theorem OAI.SnakyCertificate.MilestoneChecks.block05_correct : (rowAt 160 = data_160 ∧ Good (rowAt 160) ∧ EntryGood 160) ∧ (rowAt 161 = data_161 ∧ Good (rowAt 161) ∧ EntryGood 161) ∧ (rowAt 162 = data_162 ∧ Good (rowAt 162) ∧ EntryGood 162) ∧ (rowAt 163 = data_163 ∧ Good (rowAt 163) ∧ EntryGood 163) ∧ (rowAt 164 = data_164 ∧ Good (rowAt 164) ∧ EntryGood 164) ∧ (rowAt 165 = data_165 ∧ Good (rowAt 165) ∧ EntryGood 165) ∧ (rowAt 166 = data_166 ∧ Good (rowAt 166) ∧ EntryGood 166) ∧ (rowAt 167 = data_167 ∧ Good (rowAt 167) ∧ EntryGood 167) ∧ (rowAt 168 = data_168 ∧ Good (rowAt 168) ∧ EntryGood 168) ∧ (rowAt 169 = data_169 ∧ Good (rowAt 169) ∧ EntryGood 169) ∧ (rowAt 170 = data_170 ∧ Good (rowAt 170) ∧ EntryGood 170) ∧ (rowAt 171 = data_171 ∧ Good (rowAt 171) ∧ EntryGood 171) ∧ (rowAt 172 = data_172 ∧ Good (rowAt 172) ∧ EntryGood 172) ∧ (rowAt 173 = data_173 ∧ Good (rowAt 173) ∧ EntryGood 173) ∧ (rowAt 174 = data_174 ∧ Good (rowAt 174) ∧ EntryGood 174) ∧ (rowAt 175 = data_175 ∧ Good (rowAt 175) ∧ EntryGood 175) ∧ (rowAt 176 = data_176 ∧ Good (rowAt 176) ∧ EntryGood 176) ∧ (rowAt 177 = data_177 ∧ Good (rowAt 177) ∧ EntryGood 177) ∧ (rowAt 178 = data_178 ∧ Good (rowAt 178) ∧ EntryGood 178) ∧ (rowAt 179 = data_179 ∧ Good (rowAt 179) ∧ EntryGood 179) ∧ (rowAt 180 = data_180 ∧ Good (rowAt 180) ∧ EntryGood 180) ∧ (rowAt 181 = data_181 ∧ Good (rowAt 181) ∧ EntryGood 181) ∧ (rowAt 182 = data_182 ∧ Good (rowAt 182) ∧ EntryGood 182) ∧ (rowAt 183 = data_183 ∧ Good (rowAt 183) ∧ EntryGood 183) ∧ (rowAt 184 = data_184 ∧ Good (rowAt 184) ∧ EntryGood 184) ∧ (rowAt 185 = data_185 ∧ Good (rowAt 185) ∧ EntryGood 185) ∧ (rowAt 186 = data_186 ∧ Good (rowAt 186) ∧ EntryGood 186) ∧ (rowAt 187 = data_187 ∧ Good (rowAt 187) ∧ EntryGood 187) ∧ (rowAt 188 = data_188 ∧ Good (rowAt 188) ∧ EntryGood 188) ∧ (rowAt 189 = data_189 ∧ Good (rowAt 189) ∧ EntryGood 189) ∧ (rowAt 190 = data_190 ∧ Good (rowAt 190) ∧ EntryGood 190) ∧ (rowAt 191 = data_191 ∧ Good (rowAt 191) ∧ EntryGood 191) ∧ True := by sorry
Source
https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/ComparatorChallenges/SnakyCertificate.lean

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