YukonModule.ProximityPrize.SubmissionLower.MovingSourceReservedOwnerBudget6814.part0
DefinitionYukon_f6fa1fddb6f3331fee11343abetter-codes
Source module ProximityPrize.SubmissionLower.MovingSourceReservedOwnerBudget6814.
Definition code
import Definitions.Def_Yukon_d5f981dd1b98d3409f17e3a0
set_option backward.isDefEq.respectTransparency.types false
/-! The native branch must reserve its auxiliary charges before choosing
power avoidance. This file certifies both the reserve and its exhaustive
avoidance cover; no geometric or polynomial search is evaluated. -/
namespace ProximityPrize.SubmissionLower.MovingSourceReservedOwnerBudget6814
noncomputable section
set_option autoImplicit false
set_option maxHeartbeats 1000000
set_option maxRecDepth 15000
open WholeSpacePowerBox6814 WholeSpacePowerCover6814 MovingSourceNativeEnvelope6814
open RCN095 SecondJetRelaxedFlag
def reserve : ℕ := 120000000000000
def mainAllowance : ℕ := 271949082261391681
def exceptionNumerator (b u t : ℕ) : ℕ :=
131073*(14942095*(12*t+3561*b)+3014633*(57*t+3561*u)+
933487663*(57*b+12*u))+80890*50184*(57*b+12*u)
def normal : FlagDegree := ⟨131074*3504,131074*45-131072,131074*11⟩
def conductorNumerator (m s b u t : ℕ) : ℕ :=
flagMixed parentFlag parentFlag (m • normal+65539 • budgetFlag b u t m s)
def auxiliaryCharge (m s b u t : ℕ) : ℕ :=
3*(exceptionNumerator b u t/50184+1)+3*(conductorNumerator m s b u t/(m*m)+1)
theorem auxiliary_le_reserve (m s b u t : ℕ) (hm : 0<m) (hsb : 2*s≤b)
(hb : b≤31) (hu : u≤98) (ht : t≤995) :
auxiliaryCharge m s b u t≤reserve := by
have hpair : exceptionNumerator b u t≤759993008691575259 := by
unfold exceptionNumerator
omega
have hc : conductorNumerator m s b u t≤1634850913734*m+1445993183205 := by
have hz : t-u≤995 := by omega
have hy : u-b+s≤98 := by omega
have ha : b-2*(s-m)≤31 := by omega
norm_num [conductorNumerator,normal,parentFlag,budgetFlag,flagMixed,
nsmul_zOnly,nsmul_yz,nsmul_all] at *
omega
have hsq : 0<m*m := Nat.mul_pos hm hm
have hm2 : m≤m*m := by nlinarith
have hc2 : conductorNumerator m s b u t≤3080844096939*(m*m) := by nlinarith
have hdiv : conductorNumerator m s b u t/(m*m)≤3080844096939 := by
have hh : conductorNumerator m s b u t/(m*m)<3080844096940 :=
(Nat.div_lt_iff_lt_mul hsq).mpr (by omega)
omega
have hpdiv := Nat.div_le_div_right (c := 50184) hpair
norm_num at hpdiv
unfold auxiliaryCharge reserve
omega
theorem reserved_native_fits (m s b u t : ℕ) (hm : 0<m) (hsb : 2*s≤b)
(hb : b≤31) (hu : u≤98) (ht : t≤995)
(hmain : native m s b u t<3*mainAllowance*m) :
native m s b u t+3*m*auxiliaryCharge m s b u t<3*272069082261391681*m := by
have hh := Nat.mul_le_mul_left (3*m) (auxiliary_le_reserve m s b u t hm hsb hb hu ht)
norm_num [reserve,mainAllowance] at *
omega
def box0 : Box := ⟨3,8,10,28,28⟩
theorem box0_good : Good box0 := by
norm_num [Good,box0,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box1 : Box := ⟨3,9,10,24,128⟩
theorem box1_good : Good box1 := by
norm_num [Good,box1,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box2 : Box := ⟨3,10,10,22,26⟩
theorem box2_good : Good box2 := by
norm_num [Good,box2,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box3 : Box := ⟨2,15,15,47,313⟩
theorem box3_good : Good box3 := by
norm_num [Good,box3,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box4 : Box := ⟨1,19,23,88,383⟩
theorem box4_good : Good box4 := by
norm_num [Good,box4,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box5 : Box := ⟨1,22,31,86,86⟩
theorem box5_good : Good box5 := by
norm_num [Good,box5,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box6 : Box := ⟨1,23,24,80,750⟩
theorem box6_good : Good box6 := by
norm_num [Good,box6,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box7 : Box := ⟨1,24,24,78,898⟩
theorem box7_good : Good box7 := by
norm_num [Good,box7,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box8 : Box := ⟨1,24,25,81,422⟩
theorem box8_good : Good box8 := by
norm_num [Good,box8,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box9 : Box := ⟨1,25,25,74,839⟩
theorem box9_good : Good box9 := by
norm_num [Good,box9,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box10 : Box := ⟨1,25,25,77,630⟩
theorem box10_good : Good box10 := by
norm_num [Good,box10,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box11 : Box := ⟨1,25,26,80,213⟩
theorem box11_good : Good box11 := by
norm_num [Good,box11,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box12 : Box := ⟨1,26,26,70,848⟩
theorem box12_good : Good box12 := by
norm_num [Good,box12,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box13 : Box := ⟨1,26,26,73,640⟩
theorem box13_good : Good box13 := by
norm_num [Good,box13,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box14 : Box := ⟨1,26,26,76,362⟩
theorem box14_good : Good box14 := by
norm_num [Good,box14,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box15 : Box := ⟨1,26,31,78,78⟩
theorem box15_good : Good box15 := by
norm_num [Good,box15,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box16 : Box := ⟨1,27,27,67,788⟩
theorem box16_good : Good box16 := by
norm_num [Good,box16,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box17 : Box := ⟨1,27,27,70,580⟩
theorem box17_good : Good box17 := by
norm_num [Good,box17,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box18 : Box := ⟨1,27,27,73,302⟩
theorem box18_good : Good box18 := by
norm_num [Good,box18,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box19 : Box := ⟨1,27,28,74,173⟩
theorem box19_good : Good box19 := by
norm_num [Good,box19,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box20 : Box := ⟨1,28,29,63,590⟩
theorem box20_good : Good box20 := by
norm_num [Good,box20,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box21 : Box := ⟨1,28,31,69,69⟩
theorem box21_good : Good box21 := by
norm_num [Good,box21,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box22 : Box := ⟨1,29,31,59,322⟩
theorem box22_good : Good box22 := by
norm_num [Good,box22,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
def box23 : Box := ⟨1,30,31,51,64⟩
theorem box23_good : Good box23 := by
norm_num [Good,box23,Box.receipt,Box.n,Box.R,Box.U,Box.T,Box.C]
theorem cover1 (b u t : ℕ) (hb : b≤10) (hbu : b≤u) (hu : u≤32)
(hut : u≤t) (ht : t≤331)
(hfail : 496513814521953525≤29746364480525841*b+7705577043726672*u+110916132481287*t) :
HasBox 3 b u t := by
have hh : box0.Covers b u t ∨ box1.Covers b u t ∨ box2.Covers b u t := by
dsimp [Box.Covers,box0,box1,box2]
omega
rcases hh with h0 | h1 | h2
· exact ⟨box0,rfl,h0,box0_good⟩
· exact ⟨box1,rfl,h1,box1_good⟩
· exact ⟨box2,rfl,h2,box2_good⟩
theorem cover2 (b u t : ℕ) (hb : b≤15) (hbu : b≤u) (hu : u≤49)
(hut : u≤t) (ht : t≤497)
(hfail : 858409184769387768≤29746364480525841*b+7705577043726672*u+110916132481287*t) :
HasBox 2 b u t := by
have hh : box3.Covers b u t := by
dsimp [Box.Covers,box3]
omega
exact ⟨box3,rfl,hh,box3_good⟩
public theorem cover3_b19 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*19+7705577043726672*u+110916132481287*t) :
HasBox 1 19 u t := by
have hh : box4.Covers 19 u t := by
dsimp [Box.Covers,box4]
omega
exact ⟨box4,rfl,hh,box4_good⟩
public theorem cover3_b20 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*20+7705577043726672*u+110916132481287*t) :
HasBox 1 20 u t := by
have hh : box4.Covers 20 u t := by
dsimp [Box.Covers,box4]
omega
exact ⟨box4,rfl,hh,box4_good⟩
public theorem cover3_b21 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*21+7705577043726672*u+110916132481287*t) :
HasBox 1 21 u t := by
have hh : box4.Covers 21 u t := by
dsimp [Box.Covers,box4]
omega
exact ⟨box4,rfl,hh,box4_good⟩
public theorem cover3_b22 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*22+7705577043726672*u+110916132481287*t) :
HasBox 1 22 u t := by
have hh : box4.Covers 22 u t ∨ box5.Covers 22 u t := by
dsimp [Box.Covers,box4,box5]
omega
rcases hh with h4 | h5
· exact ⟨box4,rfl,h4,box4_good⟩
· exact ⟨box5,rfl,h5,box5_good⟩
public theorem cover3_b23 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*23+7705577043726672*u+110916132481287*t) :
HasBox 1 23 u t := by
have hh : box4.Covers 23 u t ∨ box5.Covers 23 u t ∨ box6.Covers 23 u t := by
dsimp [Box.Covers,box4,box5,box6]
omega
rcases hh with h4 | h5 | h6
· exact ⟨box4,rfl,h4,box4_good⟩
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box6,rfl,h6,box6_good⟩
public theorem cover3_b24 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*24+7705577043726672*u+110916132481287*t) :
HasBox 1 24 u t := by
have hh : box5.Covers 24 u t ∨ box6.Covers 24 u t ∨ box7.Covers 24 u t ∨ box8.Covers 24 u t := by
dsimp [Box.Covers,box5,box6,box7,box8]
omega
rcases hh with h5 | h6 | h7 | h8
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box6,rfl,h6,box6_good⟩
· exact ⟨box7,rfl,h7,box7_good⟩
· exact ⟨box8,rfl,h8,box8_good⟩
public theorem cover3_b25 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*25+7705577043726672*u+110916132481287*t) :
HasBox 1 25 u t := by
have hh : box5.Covers 25 u t ∨ box8.Covers 25 u t ∨ box9.Covers 25 u t ∨ box10.Covers 25 u t ∨ box11.Covers 25 u t := by
dsimp [Box.Covers,box5,box8,box9,box10,box11]
omega
rcases hh with h5 | h8 | h9 | h10 | h11
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box8,rfl,h8,box8_good⟩
· exact ⟨box9,rfl,h9,box9_good⟩
· exact ⟨box10,rfl,h10,box10_good⟩
· exact ⟨box11,rfl,h11,box11_good⟩
public theorem cover3_b26 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*26+7705577043726672*u+110916132481287*t) :
HasBox 1 26 u t := by
have hh : box5.Covers 26 u t ∨ box11.Covers 26 u t ∨ box12.Covers 26 u t ∨ box13.Covers 26 u t ∨ box14.Covers 26 u t ∨ box15.Covers 26 u t := by
dsimp [Box.Covers,box5,box11,box12,box13,box14,box15]
omega
rcases hh with h5 | h11 | h12 | h13 | h14 | h15
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box11,rfl,h11,box11_good⟩
· exact ⟨box12,rfl,h12,box12_good⟩
· exact ⟨box13,rfl,h13,box13_good⟩
· exact ⟨box14,rfl,h14,box14_good⟩
· exact ⟨box15,rfl,h15,box15_good⟩
public theorem cover3_b27 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*27+7705577043726672*u+110916132481287*t) :
HasBox 1 27 u t := by
have hh : box5.Covers 27 u t ∨ box15.Covers 27 u t ∨ box16.Covers 27 u t ∨ box17.Covers 27 u t ∨ box18.Covers 27 u t ∨ box19.Covers 27 u t := by
dsimp [Box.Covers,box5,box15,box16,box17,box18,box19]
omega
rcases hh with h5 | h15 | h16 | h17 | h18 | h19
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box15,rfl,h15,box15_good⟩
· exact ⟨box16,rfl,h16,box16_good⟩
· exact ⟨box17,rfl,h17,box17_good⟩
· exact ⟨box18,rfl,h18,box18_good⟩
· exact ⟨box19,rfl,h19,box19_good⟩
public theorem cover3_b28 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*28+7705577043726672*u+110916132481287*t) :
HasBox 1 28 u t := by
have hh : box5.Covers 28 u t ∨ box15.Covers 28 u t ∨ box19.Covers 28 u t ∨ box20.Covers 28 u t ∨ box21.Covers 28 u t := by
dsimp [Box.Covers,box5,box15,box19,box20,box21]
omega
rcases hh with h5 | h15 | h19 | h20 | h21
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box15,rfl,h15,box15_good⟩
· exact ⟨box19,rfl,h19,box19_good⟩
· exact ⟨box20,rfl,h20,box20_good⟩
· exact ⟨box21,rfl,h21,box21_good⟩
public theorem cover3_b29 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*29+7705577043726672*u+110916132481287*t) :
HasBox 1 29 u t := by
have hh : box5.Covers 29 u t ∨ box15.Covers 29 u t ∨ box20.Covers 29 u t ∨ box21.Covers 29 u t ∨ box22.Covers 29 u t := by
dsimp [Box.Covers,box5,box15,box20,box21,box22]
omega
rcases hh with h5 | h15 | h20 | h21 | h22
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box15,rfl,h15,box15_good⟩
· exact ⟨box20,rfl,h20,box20_good⟩
· exact ⟨box21,rfl,h21,box21_good⟩
· exact ⟨box22,rfl,h22,box22_good⟩
public theorem cover3_b30 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*30+7705577043726672*u+110916132481287*t) :
HasBox 1 30 u t := by
have hh : box5.Covers 30 u t ∨ box15.Covers 30 u t ∨ box21.Covers 30 u t ∨ box22.Covers 30 u t ∨ box23.Covers 30 u t := by
dsimp [Box.Covers,box5,box15,box21,box22,box23]
omega
rcases hh with h5 | h15 | h21 | h22 | h23
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box15,rfl,h15,box15_good⟩
· exact ⟨box21,rfl,h21,box21_good⟩
· exact ⟨box22,rfl,h22,box22_good⟩
· exact ⟨box23,rfl,h23,box23_good⟩
public theorem cover3_b31 (u t : ℕ) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*31+7705577043726672*u+110916132481287*t) :
HasBox 1 31 u t := by
have hh : box5.Covers 31 u t ∨ box15.Covers 31 u t ∨ box21.Covers 31 u t ∨ box22.Covers 31 u t ∨ box23.Covers 31 u t := by
dsimp [Box.Covers,box5,box15,box21,box22,box23]
omega
rcases hh with h5 | h15 | h21 | h22 | h23
· exact ⟨box5,rfl,h5,box5_good⟩
· exact ⟨box15,rfl,h15,box15_good⟩
· exact ⟨box21,rfl,h21,box21_good⟩
· exact ⟨box22,rfl,h22,box22_good⟩
· exact ⟨box23,rfl,h23,box23_good⟩
theorem cover3 (b u t : ℕ) (hb : b≤31) (hu : u≤98) (hut : u≤t) (ht : t≤995)
(hfail : 1422232221428600934≤29746364480525841*b+7705577043726672*u+110916132481287*t) :
HasBox 1 b u t := by
have hb19 : 19≤b := by omega
interval_cases b
· exact cover3_b19 u t hu hut ht hfail
· exact cover3_b20 u t hu hut ht hfail
· exact cover3_b21 u t hu hut ht hfail
· exact cover3_b22 u t hu hut ht hfail
· exact cover3_b23 u t hu hut ht hfail
· exact cover3_b24 u t hu hut ht hfail
· exact cover3_b25 u t hu hut ht hfail
· exact cover3_b26 u t hu hut ht hfail
· exact cover3_b27 u t hu hut ht hfail
· exact cover3_b28 u t hu hut ht hfail
· exact cover3_b29 u t hu hut ht hfail
· exact cover3_b30 u t hu hut ht hfail
· exact cover3_b31 u t hu hut ht hfail
end
end ProximityPrize.SubmissionLower.MovingSourceReservedOwnerBudget6814
Source