Round: sat enc Cnf
ProvedCircuitLowerBound.Round.sat_encCnfalgorithmsanthropic-eth-16a5ce4complexity-theory
The code of a formula is in SAT if and only if the formula is satisfiable.
Preamble
/- Copyright (c) 2026 Anthropic, PBC. All rights reserved. Released under Apache 2.0; SPDX-License-Identifier: Apache-2.0. Source and original notices: https://github.com/anthropics/formal-math/blob/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth/NOTICE -/ import Definitions.Def_CircuitLowerBound_InterfacesPolyT import Definitions.Def_PaddedDescent_Pad import Definitions.Def_ToTuring_Poly_Decode import Definitions.Def_ToTuring_Poly_Sat import Definitions.Def_ToTuring_Lib_List3 import Definitions.Def_ToTuring_Lib_Nat2 import Definitions.Def_ToTuring_Lib_Unary import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_ENP_Round set_option autoImplicit false section section open CircuitLowerBound open ENP Groundwork open CircuitLowerBound.Round
Formal statement
theorem CircuitLowerBound.Round.sat_encCnf (φ : Cnf) : SAT (encCnf φ) ↔ Sat φ := by sorry
Source