import Noperthedron.ProofOfMainTheoremWithHole
import NativeCaseAnalysis.ComputationalStep

/-!
Proof of the main theorem, with the solution table actually verified
(by `native_decide`; see `NativeCaseAnalysis/ComputationalStep.lean`).
-/

namespace Noperthedron.NativeCaseAnalysis

open Noperthedron

/--
  There exists a convex polyhedron that does not have the Rupert property.
-/
theorem exists_not_rupert : ExistsNonRupertPolyhedron :=
  valid_table_implies_exists_not_rupert solutionTable

/- Expected: `propext`, `Classical.choice`, `Quot.sound`, and the two
`native_decide` axiom instances — no `sorryAx`. -/
#print axioms exists_not_rupert

end Noperthedron.NativeCaseAnalysis
