% TIMEFORMAT='%3R'; { time (exec 2>&1; /home/martin/bin/satallax -E /home/martin/.isabelle/contrib/e-2.5-1/x86_64-linux/eprover -p tstp -t 5 /home/martin/judgement-day/tptp-thf/tptp/StrongNorm/prob_280__5212412_1 ) ; }
% This file was generated by Isabelle (most likely Sledgehammer)
% 2020-12-16 14:38:52.984

% Could-be-implicit typings (6)
thf(ty_n_t__List__Olist_It__Lambda__OdB_J, type,
    list_dB : $tType).
thf(ty_n_t__Set__Oset_It__Lambda__OdB_J, type,
    set_dB : $tType).
thf(ty_n_t__LambdaType__Otype, type,
    type : $tType).
thf(ty_n_t__Lambda__OdB, type,
    dB : $tType).
thf(ty_n_t__Nat__Onat, type,
    nat : $tType).
thf(ty_n_t__Int__Oint, type,
    int : $tType).

% Explicit typings (29)
thf(sy_c_Groups_Ouminus__class_Ouminus_001t__Int__Oint, type,
    uminus_uminus_int : int > int).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Int__Oint, type,
    zero_zero_int : int).
thf(sy_c_Groups_Ozero__class_Ozero_001t__Nat__Onat, type,
    zero_zero_nat : nat).
thf(sy_c_If_001t__Nat__Onat, type,
    if_nat : $o > nat > nat > nat).
thf(sy_c_InductTermi_OIT, type,
    it : dB > $o).
thf(sy_c_Int_Onat, type,
    nat2 : int > nat).
thf(sy_c_LambdaType_Oshift_001t__LambdaType__Otype, type,
    shift_type : (nat > type) > nat > type > nat > type).
thf(sy_c_LambdaType_Otype_OFun, type,
    fun : type > type > type).
thf(sy_c_LambdaType_Otyping, type,
    typing : (nat > type) > dB > type > $o).
thf(sy_c_Lambda_OdB_OAbs, type,
    abs : dB > dB).
thf(sy_c_Lambda_OdB_OApp, type,
    app : dB > dB > dB).
thf(sy_c_Lambda_OdB_OVar, type,
    var : nat > dB).
thf(sy_c_Lambda_OdB_Osize__dB, type,
    size_dB : dB > nat).
thf(sy_c_Lambda_Olift, type,
    lift : dB > nat > dB).
thf(sy_c_Lambda_Oliftn, type,
    liftn : nat > dB > nat > dB).
thf(sy_c_Lambda_Osubst, type,
    subst : dB > dB > nat > dB).
thf(sy_c_Lambda_Osubstn, type,
    substn : dB > dB > nat > dB).
thf(sy_c_List_Ofoldl_001t__Lambda__OdB_001t__Lambda__OdB, type,
    foldl_dB_dB : (dB > dB > dB) > dB > list_dB > dB).
thf(sy_c_List_Olist_Oset_001t__Lambda__OdB, type,
    set_dB2 : list_dB > set_dB).
thf(sy_c_List_Olistsp_001t__Lambda__OdB, type,
    listsp_dB : (dB > $o) > list_dB > $o).
thf(sy_c_Nat_Osemiring__1__class_Oof__nat_001t__Int__Oint, type,
    semiri2019852685at_int : nat > int).
thf(sy_c_Nat_Osemiring__1__class_Oof__nat_001t__Nat__Onat, type,
    semiri1382578993at_nat : nat > nat).
thf(sy_c_Nat_Osize__class_Osize_001t__Lambda__OdB, type,
    size_size_dB : dB > nat).
thf(sy_c_Orderings_Oord__class_Oless_001t__Int__Oint, type,
    ord_less_int : int > int > $o).
thf(sy_c_Orderings_Oord__class_Oless_001t__Nat__Onat, type,
    ord_less_nat : nat > nat > $o).
thf(sy_c_member_001t__Lambda__OdB, type,
    member_dB : dB > set_dB > $o).
thf(sy_v_T, type,
    t : type).
thf(sy_v_e, type,
    e : nat > type).
thf(sy_v_t, type,
    t2 : dB).

% Relevant facts (146)
thf(fact_0__092_060open_062e_A_092_060turnstile_062_At_A_058_AT_092_060close_062, axiom,
    ((typing @ e @ t2 @ t))). % \<open>e \<turnstile> t : T\<close>
thf(fact_1_type__implies__IT, axiom,
    ((![E : nat > type, T : dB, T2 : type]: ((typing @ E @ T @ T2) => (it @ T))))). % type_implies_IT
thf(fact_2_lift__IT, axiom,
    ((![T : dB, I : nat]: ((it @ T) => (it @ (lift @ T @ I)))))). % lift_IT
thf(fact_3_Var__IT, axiom,
    ((![N : nat]: (it @ (var @ N))))). % Var_IT
thf(fact_4_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_5_subst__Var__IT, axiom,
    ((![R : dB, I : nat, J : nat]: ((it @ R) => (it @ (subst @ R @ (var @ I) @ J)))))). % subst_Var_IT
thf(fact_6_subst__type__IT, axiom,
    ((![T : dB, E : nat > type, I : nat, U : type, T2 : type, U2 : dB]: ((it @ T) => ((typing @ (shift_type @ E @ I @ U) @ T @ T2) => ((it @ U2) => ((typing @ E @ U2 @ U) => (it @ (subst @ T @ U2 @ I))))))))). % subst_type_IT
thf(fact_7_app__Var__IT, axiom,
    ((![T : dB, I : nat]: ((it @ T) => (it @ (app @ T @ (var @ I))))))). % app_Var_IT
thf(fact_8_lift__type, axiom,
    ((![E : nat > type, T : dB, T2 : type, I : nat, U : type]: ((typing @ E @ T @ T2) => (typing @ (shift_type @ E @ I @ U) @ (lift @ T @ I) @ T2))))). % lift_type
thf(fact_9_subst__lift, axiom,
    ((![T : dB, K : nat, S : dB]: ((subst @ (lift @ T @ K) @ S @ K) = T)))). % subst_lift
thf(fact_10_subst__eq, axiom,
    ((![K : nat, U2 : dB]: ((subst @ (var @ K) @ U2 @ K) = U2)))). % subst_eq
thf(fact_11_subst__lemma, axiom,
    ((![E : nat > type, T : dB, T2 : type, E2 : nat > type, U2 : dB, U : type, I : nat]: ((typing @ E @ T @ T2) => ((typing @ E2 @ U2 @ U) => ((E = (shift_type @ E2 @ I @ U)) => (typing @ E2 @ (subst @ T @ U2 @ I) @ T2))))))). % subst_lemma
thf(fact_12_dB_Oinduct, axiom,
    ((![P : dB > $o, DB : dB]: ((![X : nat]: (P @ (var @ X))) => ((![X1a : dB, X2 : dB]: ((P @ X1a) => ((P @ X2) => (P @ (app @ X1a @ X2))))) => ((![X : dB]: ((P @ X) => (P @ (abs @ X)))) => (P @ DB))))))). % dB.induct
thf(fact_13_dB_Oexhaust, axiom,
    ((![Y : dB]: ((![X1 : nat]: (~ ((Y = (var @ X1))))) => ((![X21 : dB, X22 : dB]: (~ ((Y = (app @ X21 @ X22))))) => (~ ((![X3 : dB]: (~ ((Y = (abs @ X3)))))))))))). % dB.exhaust
thf(fact_14_shift__eq, axiom,
    ((![I : nat, J : nat, E : nat > type, T2 : type]: ((I = J) => ((shift_type @ E @ I @ T2 @ J) = T2))))). % shift_eq
thf(fact_15_dB_Oinject_I1_J, axiom,
    ((![X12 : nat, Y1 : nat]: (((var @ X12) = (var @ Y1)) = (X12 = Y1))))). % dB.inject(1)
thf(fact_16_dB_Oinject_I3_J, axiom,
    ((![X32 : dB, Y3 : dB]: (((abs @ X32) = (abs @ Y3)) = (X32 = Y3))))). % dB.inject(3)
thf(fact_17_dB_Oinject_I2_J, axiom,
    ((![X212 : dB, X222 : dB, Y21 : dB, Y22 : dB]: (((app @ X212 @ X222) = (app @ Y21 @ Y22)) = (((X212 = Y21)) & ((X222 = Y22))))))). % dB.inject(2)
thf(fact_18_lift_Osimps_I2_J, axiom,
    ((![S : dB, T : dB, K : nat]: ((lift @ (app @ S @ T) @ K) = (app @ (lift @ S @ K) @ (lift @ T @ K)))))). % lift.simps(2)
thf(fact_19_dB_Odistinct_I5_J, axiom,
    ((![X212 : dB, X222 : dB, X32 : dB]: (~ (((app @ X212 @ X222) = (abs @ X32))))))). % dB.distinct(5)
thf(fact_20_dB_Odistinct_I1_J, axiom,
    ((![X12 : nat, X212 : dB, X222 : dB]: (~ (((var @ X12) = (app @ X212 @ X222))))))). % dB.distinct(1)
thf(fact_21_subst__App, axiom,
    ((![T : dB, U2 : dB, S : dB, K : nat]: ((subst @ (app @ T @ U2) @ S @ K) = (app @ (subst @ T @ S @ K) @ (subst @ U2 @ S @ K)))))). % subst_App
thf(fact_22_dB_Odistinct_I3_J, axiom,
    ((![X12 : nat, X32 : dB]: (~ (((var @ X12) = (abs @ X32))))))). % dB.distinct(3)
thf(fact_23_typing_OVar, axiom,
    ((![Env : nat > type, X4 : nat, T2 : type]: (((Env @ X4) = T2) => (typing @ Env @ (var @ X4) @ T2))))). % typing.Var
thf(fact_24_typing__elims_I1_J, axiom,
    ((![E : nat > type, I : nat, T2 : type]: ((typing @ E @ (var @ I) @ T2) => ((E @ I) = T2))))). % typing_elims(1)
thf(fact_25_abs__typeE, axiom,
    ((![E : nat > type, T : dB, T2 : type]: ((typing @ E @ (abs @ T) @ T2) => (~ ((![U3 : type, V : type]: (~ ((typing @ (shift_type @ E @ zero_zero_nat @ U3) @ T @ V)))))))))). % abs_typeE
thf(fact_26_typing_Oinducts, axiom,
    ((![X12 : nat > type, X23 : dB, X32 : type, P : (nat > type) > dB > type > $o]: ((typing @ X12 @ X23 @ X32) => ((![Env2 : nat > type, X : nat, T3 : type]: (((Env2 @ X) = T3) => (P @ Env2 @ (var @ X) @ T3))) => ((![Env2 : nat > type, T3 : type, T4 : dB, U3 : type]: ((typing @ (shift_type @ Env2 @ zero_zero_nat @ T3) @ T4 @ U3) => ((P @ (shift_type @ Env2 @ zero_zero_nat @ T3) @ T4 @ U3) => (P @ Env2 @ (abs @ T4) @ (fun @ T3 @ U3))))) => ((![Env2 : nat > type, S2 : dB, T3 : type, U3 : type, T4 : dB]: ((typing @ Env2 @ S2 @ (fun @ T3 @ U3)) => ((P @ Env2 @ S2 @ (fun @ T3 @ U3)) => ((typing @ Env2 @ T4 @ T3) => ((P @ Env2 @ T4 @ T3) => (P @ Env2 @ (app @ S2 @ T4) @ U3)))))) => (P @ X12 @ X23 @ X32)))))))). % typing.inducts
thf(fact_27_typing_Osimps, axiom,
    ((typing = (^[A1 : nat > type]: (^[A2 : dB]: (^[A3 : type]: (((?[Env3 : nat > type]: (?[X5 : nat]: (?[T5 : type]: (((A1 = Env3)) & ((((A2 = (var @ X5))) & ((((A3 = T5)) & (((Env3 @ X5) = T5))))))))))) | ((((?[Env3 : nat > type]: (?[T5 : type]: (?[T6 : dB]: (?[U4 : type]: (((A1 = Env3)) & ((((A2 = (abs @ T6))) & ((((A3 = (fun @ T5 @ U4))) & ((typing @ (shift_type @ Env3 @ zero_zero_nat @ T5) @ T6 @ U4)))))))))))) | ((?[Env3 : nat > type]: (?[S3 : dB]: (?[T5 : type]: (?[U4 : type]: (?[T6 : dB]: (((A1 = Env3)) & ((((A2 = (app @ S3 @ T6))) & ((((A3 = U4)) & ((((typing @ Env3 @ S3 @ (fun @ T5 @ U4))) & ((typing @ Env3 @ T6 @ T5)))))))))))))))))))))))). % typing.simps
thf(fact_28_typing_Ocases, axiom,
    ((![A12 : nat > type, A22 : dB, A32 : type]: ((typing @ A12 @ A22 @ A32) => ((![X : nat]: ((A22 = (var @ X)) => (~ (((A12 @ X) = A32))))) => ((![T3 : type, T4 : dB]: ((A22 = (abs @ T4)) => (![U3 : type]: ((A32 = (fun @ T3 @ U3)) => (~ ((typing @ (shift_type @ A12 @ zero_zero_nat @ T3) @ T4 @ U3))))))) => (~ ((![S2 : dB, T3 : type, U3 : type, T4 : dB]: ((A22 = (app @ S2 @ T4)) => ((A32 = U3) => ((typing @ A12 @ S2 @ (fun @ T3 @ U3)) => (~ ((typing @ A12 @ T4 @ T3))))))))))))))). % typing.cases
thf(fact_29_var__app__type__eq, axiom,
    ((![E : nat > type, I : nat, Ts : list_dB, T2 : type, U : type]: ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ T2) => ((typing @ E @ (foldl_dB_dB @ app @ (var @ I) @ Ts) @ U) => (T2 = U)))))). % var_app_type_eq
thf(fact_30_subst__lt, axiom,
    ((![J : nat, I : nat, U2 : dB]: ((ord_less_nat @ J @ I) => ((subst @ (var @ J) @ U2 @ I) = (var @ J)))))). % subst_lt
thf(fact_31_App, axiom,
    ((![Env : nat > type, S : dB, T2 : type, U : type, T : dB]: ((typing @ Env @ S @ (fun @ T2 @ U)) => ((typing @ Env @ T @ T2) => (typing @ Env @ (app @ S @ T) @ U)))))). % App
thf(fact_32_typing__elims_I2_J, axiom,
    ((![E : nat > type, T : dB, U2 : dB, T2 : type]: ((typing @ E @ (app @ T @ U2) @ T2) => (~ ((![T3 : type]: ((typing @ E @ T @ (fun @ T3 @ T2)) => (~ ((typing @ E @ U2 @ T3))))))))))). % typing_elims(2)
thf(fact_33_type_Oinject_I2_J, axiom,
    ((![X212 : type, X222 : type, Y21 : type, Y22 : type]: (((fun @ X212 @ X222) = (fun @ Y21 @ Y22)) = (((X212 = Y21)) & ((X222 = Y22))))))). % type.inject(2)
thf(fact_34_shift__gt, axiom,
    ((![J : nat, I : nat, E : nat > type, T2 : type]: ((ord_less_nat @ J @ I) => ((shift_type @ E @ I @ T2 @ J) = (E @ J)))))). % shift_gt
thf(fact_35_type__induct, axiom,
    ((![P : type > $o, T2 : type]: ((![T3 : type]: ((![T1 : type, T22 : type]: ((T3 = (fun @ T1 @ T22)) => (P @ T1))) => ((![T1 : type, T22 : type]: ((T3 = (fun @ T1 @ T22)) => (P @ T22))) => (P @ T3)))) => (P @ T2))))). % type_induct
thf(fact_36_typing__elims_I3_J, axiom,
    ((![E : nat > type, T : dB, T2 : type]: ((typing @ E @ (abs @ T) @ T2) => (~ ((![T3 : type, U3 : type]: ((T2 = (fun @ T3 @ U3)) => (~ ((typing @ (shift_type @ E @ zero_zero_nat @ T3) @ T @ U3))))))))))). % typing_elims(3)
thf(fact_37_Abs, axiom,
    ((![Env : nat > type, T2 : type, T : dB, U : type]: ((typing @ (shift_type @ Env @ zero_zero_nat @ T2) @ T @ U) => (typing @ Env @ (abs @ T) @ (fun @ T2 @ U)))))). % Abs
thf(fact_38_Beta, axiom,
    ((![R : dB, S : dB, Ss : list_dB]: ((it @ (foldl_dB_dB @ app @ (subst @ R @ S @ zero_zero_nat) @ Ss)) => ((it @ S) => (it @ (foldl_dB_dB @ app @ (app @ (abs @ R) @ S) @ Ss))))))). % Beta
thf(fact_39_Var__apps__eq__Var__apps__conv, axiom,
    ((![M : nat, Rs : list_dB, N : nat, Ss : list_dB]: (((foldl_dB_dB @ app @ (var @ M) @ Rs) = (foldl_dB_dB @ app @ (var @ N) @ Ss)) = (((M = N)) & ((Rs = Ss))))))). % Var_apps_eq_Var_apps_conv
thf(fact_40_Abs__apps__eq__Abs__apps__conv, axiom,
    ((![R : dB, Rs : list_dB, S : dB, Ss : list_dB]: (((foldl_dB_dB @ app @ (abs @ R) @ Rs) = (foldl_dB_dB @ app @ (abs @ S) @ Ss)) = (((R = S)) & ((Rs = Ss))))))). % Abs_apps_eq_Abs_apps_conv
thf(fact_41_apps__eq__tail__conv, axiom,
    ((![R : dB, Ts : list_dB, S : dB]: (((foldl_dB_dB @ app @ R @ Ts) = (foldl_dB_dB @ app @ S @ Ts)) = (R = S))))). % apps_eq_tail_conv
thf(fact_42_neq0__conv, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ N))))). % neq0_conv
thf(fact_43_less__nat__zero__code, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_nat_zero_code
thf(fact_44_bot__nat__0_Onot__eq__extremum, axiom,
    ((![A : nat]: ((~ ((A = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ A))))). % bot_nat_0.not_eq_extremum
thf(fact_45_not__gr__zero, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr_zero
thf(fact_46_zero__reorient, axiom,
    ((![X4 : nat]: ((zero_zero_nat = X4) = (X4 = zero_zero_nat))))). % zero_reorient
thf(fact_47_zero__reorient, axiom,
    ((![X4 : int]: ((zero_zero_int = X4) = (X4 = zero_zero_int))))). % zero_reorient
thf(fact_48_linorder__neqE__nat, axiom,
    ((![X4 : nat, Y : nat]: ((~ ((X4 = Y))) => ((~ ((ord_less_nat @ X4 @ Y))) => (ord_less_nat @ Y @ X4)))))). % linorder_neqE_nat
thf(fact_49_infinite__descent, axiom,
    ((![P : nat > $o, N : nat]: ((![N2 : nat]: ((~ ((P @ N2))) => (?[M2 : nat]: ((ord_less_nat @ M2 @ N2) & (~ ((P @ M2))))))) => (P @ N))))). % infinite_descent
thf(fact_50_nat__less__induct, axiom,
    ((![P : nat > $o, N : nat]: ((![N2 : nat]: ((![M2 : nat]: ((ord_less_nat @ M2 @ N2) => (P @ M2))) => (P @ N2))) => (P @ N))))). % nat_less_induct
thf(fact_51_less__irrefl__nat, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_irrefl_nat
thf(fact_52_less__not__refl3, axiom,
    ((![S : nat, T : nat]: ((ord_less_nat @ S @ T) => (~ ((S = T))))))). % less_not_refl3
thf(fact_53_less__not__refl2, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ N @ M) => (~ ((M = N))))))). % less_not_refl2
thf(fact_54_less__not__refl, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_not_refl
thf(fact_55_nat__neq__iff, axiom,
    ((![M : nat, N : nat]: ((~ ((M = N))) = (((ord_less_nat @ M @ N)) | ((ord_less_nat @ N @ M))))))). % nat_neq_iff
thf(fact_56_zero__less__iff__neq__zero, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ N) = (~ ((N = zero_zero_nat))))))). % zero_less_iff_neq_zero
thf(fact_57_gr__implies__not__zero, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not_zero
thf(fact_58_not__less__zero, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less_zero
thf(fact_59_gr__zeroI, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr_zeroI
thf(fact_60_bot__nat__0_Oextremum__strict, axiom,
    ((![A : nat]: (~ ((ord_less_nat @ A @ zero_zero_nat)))))). % bot_nat_0.extremum_strict
thf(fact_61_infinite__descent0, axiom,
    ((![P : nat > $o, N : nat]: ((P @ zero_zero_nat) => ((![N2 : nat]: ((ord_less_nat @ zero_zero_nat @ N2) => ((~ ((P @ N2))) => (?[M2 : nat]: ((ord_less_nat @ M2 @ N2) & (~ ((P @ M2)))))))) => (P @ N)))))). % infinite_descent0
thf(fact_62_gr__implies__not0, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not0
thf(fact_63_less__zeroE, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_zeroE
thf(fact_64_not__less0, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less0
thf(fact_65_not__gr0, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr0
thf(fact_66_gr0I, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr0I
thf(fact_67_Var__apps__neq__Abs__apps, axiom,
    ((![N : nat, Ts : list_dB, R : dB, Ss : list_dB]: (~ (((foldl_dB_dB @ app @ (var @ N) @ Ts) = (foldl_dB_dB @ app @ (abs @ R) @ Ss))))))). % Var_apps_neq_Abs_apps
thf(fact_68_Abs__App__neq__Var__apps, axiom,
    ((![S : dB, T : dB, N : nat, Ss : list_dB]: (~ (((app @ (abs @ S) @ T) = (foldl_dB_dB @ app @ (var @ N) @ Ss))))))). % Abs_App_neq_Var_apps
thf(fact_69_ex__head__tail, axiom,
    ((![T : dB]: (?[Ts2 : list_dB, H : dB]: ((T = (foldl_dB_dB @ app @ H @ Ts2)) & ((?[N2 : nat]: (H = (var @ N2))) | (?[U5 : dB]: (H = (abs @ U5))))))))). % ex_head_tail
thf(fact_70_IT_Osimps, axiom,
    ((it = (^[A4 : dB]: (((?[Rs2 : list_dB]: (?[N3 : nat]: (((A4 = (foldl_dB_dB @ app @ (var @ N3) @ Rs2))) & ((listsp_dB @ it @ Rs2)))))) | ((((?[R2 : dB]: (((A4 = (abs @ R2))) & ((it @ R2))))) | ((?[R2 : dB]: (?[S3 : dB]: (?[Ss2 : list_dB]: (((A4 = (foldl_dB_dB @ app @ (app @ (abs @ R2) @ S3) @ Ss2))) & ((((it @ (foldl_dB_dB @ app @ (subst @ R2 @ S3 @ zero_zero_nat) @ Ss2))) & ((it @ S3)))))))))))))))). % IT.simps
thf(fact_71_IT_Ocases, axiom,
    ((![A : dB]: ((it @ A) => ((![Rs3 : list_dB]: ((?[N2 : nat]: (A = (foldl_dB_dB @ app @ (var @ N2) @ Rs3))) => (~ ((listsp_dB @ it @ Rs3))))) => ((![R3 : dB]: ((A = (abs @ R3)) => (~ ((it @ R3))))) => (~ ((![R3 : dB, S2 : dB, Ss3 : list_dB]: ((A = (foldl_dB_dB @ app @ (app @ (abs @ R3) @ S2) @ Ss3)) => ((it @ (foldl_dB_dB @ app @ (subst @ R3 @ S2 @ zero_zero_nat) @ Ss3)) => (~ ((it @ S2)))))))))))))). % IT.cases
thf(fact_72_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_nat @ zero_zero_nat @ zero_zero_nat))))). % less_numeral_extra(3)
thf(fact_73_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_int @ zero_zero_int @ zero_zero_int))))). % less_numeral_extra(3)
thf(fact_74_dB_Osize__gen_I1_J, axiom,
    ((![X12 : nat]: ((size_dB @ (var @ X12)) = zero_zero_nat)))). % dB.size_gen(1)
thf(fact_75_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_76_of__nat__0__less__iff, axiom,
    ((![N : nat]: ((ord_less_nat @ zero_zero_nat @ (semiri1382578993at_nat @ N)) = (ord_less_nat @ zero_zero_nat @ N))))). % of_nat_0_less_iff
thf(fact_77_of__nat__0__less__iff, axiom,
    ((![N : nat]: ((ord_less_int @ zero_zero_int @ (semiri2019852685at_int @ N)) = (ord_less_nat @ zero_zero_nat @ N))))). % of_nat_0_less_iff
thf(fact_78_of__nat__eq__iff, axiom,
    ((![M : nat, N : nat]: (((semiri2019852685at_int @ M) = (semiri2019852685at_int @ N)) = (M = N))))). % of_nat_eq_iff
thf(fact_79_of__nat__0, axiom,
    (((semiri1382578993at_nat @ zero_zero_nat) = zero_zero_nat))). % of_nat_0
thf(fact_80_of__nat__0, axiom,
    (((semiri2019852685at_int @ zero_zero_nat) = zero_zero_int))). % of_nat_0
thf(fact_81_of__nat__0__eq__iff, axiom,
    ((![N : nat]: ((zero_zero_nat = (semiri1382578993at_nat @ N)) = (zero_zero_nat = N))))). % of_nat_0_eq_iff
thf(fact_82_of__nat__0__eq__iff, axiom,
    ((![N : nat]: ((zero_zero_int = (semiri2019852685at_int @ N)) = (zero_zero_nat = N))))). % of_nat_0_eq_iff
thf(fact_83_of__nat__eq__0__iff, axiom,
    ((![M : nat]: (((semiri1382578993at_nat @ M) = zero_zero_nat) = (M = zero_zero_nat))))). % of_nat_eq_0_iff
thf(fact_84_of__nat__eq__0__iff, axiom,
    ((![M : nat]: (((semiri2019852685at_int @ M) = zero_zero_int) = (M = zero_zero_nat))))). % of_nat_eq_0_iff
thf(fact_85_of__nat__less__iff, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)) = (ord_less_nat @ M @ N))))). % of_nat_less_iff
thf(fact_86_of__nat__less__iff, axiom,
    ((![M : nat, N : nat]: ((ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)) = (ord_less_nat @ M @ N))))). % of_nat_less_iff
thf(fact_87_of__nat__less__0__iff, axiom,
    ((![M : nat]: (~ ((ord_less_nat @ (semiri1382578993at_nat @ M) @ zero_zero_nat)))))). % of_nat_less_0_iff
thf(fact_88_of__nat__less__0__iff, axiom,
    ((![M : nat]: (~ ((ord_less_int @ (semiri2019852685at_int @ M) @ zero_zero_int)))))). % of_nat_less_0_iff
thf(fact_89_less__imp__of__nat__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)))))). % less_imp_of_nat_less
thf(fact_90_less__imp__of__nat__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)))))). % less_imp_of_nat_less
thf(fact_91_of__nat__less__imp__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ (semiri1382578993at_nat @ M) @ (semiri1382578993at_nat @ N)) => (ord_less_nat @ M @ N))))). % of_nat_less_imp_less
thf(fact_92_of__nat__less__imp__less, axiom,
    ((![M : nat, N : nat]: ((ord_less_int @ (semiri2019852685at_int @ M) @ (semiri2019852685at_int @ N)) => (ord_less_nat @ M @ N))))). % of_nat_less_imp_less
thf(fact_93_zero__less__imp__eq__int, axiom,
    ((![K : int]: ((ord_less_int @ zero_zero_int @ K) => (?[N2 : nat]: ((ord_less_nat @ zero_zero_nat @ N2) & (K = (semiri2019852685at_int @ N2)))))))). % zero_less_imp_eq_int
thf(fact_94_pos__int__cases, axiom,
    ((![K : int]: ((ord_less_int @ zero_zero_int @ K) => (~ ((![N2 : nat]: ((K = (semiri2019852685at_int @ N2)) => (~ ((ord_less_nat @ zero_zero_nat @ N2))))))))))). % pos_int_cases
thf(fact_95_substn__subst__0, axiom,
    ((![T : dB, S : dB]: ((substn @ T @ S @ zero_zero_nat) = (subst @ T @ S @ zero_zero_nat))))). % substn_subst_0
thf(fact_96_int__int__eq, axiom,
    ((![M : nat, N : nat]: (((semiri2019852685at_int @ M) = (semiri2019852685at_int @ N)) = (M = N))))). % int_int_eq
thf(fact_97_substn_Osimps_I2_J, axiom,
    ((![T : dB, U2 : dB, S : dB, K : nat]: ((substn @ (app @ T @ U2) @ S @ K) = (app @ (substn @ T @ S @ K) @ (substn @ U2 @ S @ K)))))). % substn.simps(2)
thf(fact_98_nat__int__comparison_I2_J, axiom,
    ((ord_less_nat = (^[A4 : nat]: (^[B : nat]: (ord_less_int @ (semiri2019852685at_int @ A4) @ (semiri2019852685at_int @ B))))))). % nat_int_comparison(2)
thf(fact_99_int__ops_I1_J, axiom,
    (((semiri2019852685at_int @ zero_zero_nat) = zero_zero_int))). % int_ops(1)
thf(fact_100_substn__subst__n, axiom,
    ((substn = (^[T6 : dB]: (^[S3 : dB]: (^[N3 : nat]: (subst @ T6 @ (liftn @ N3 @ S3 @ zero_zero_nat) @ N3))))))). % substn_subst_n
thf(fact_101_liftn__0, axiom,
    ((![T : dB, K : nat]: ((liftn @ zero_zero_nat @ T @ K) = T)))). % liftn_0
thf(fact_102_liftn_Osimps_I2_J, axiom,
    ((![N : nat, S : dB, T : dB, K : nat]: ((liftn @ N @ (app @ S @ T) @ K) = (app @ (liftn @ N @ S @ K) @ (liftn @ N @ T @ K)))))). % liftn.simps(2)
thf(fact_103_verit__comp__simplify1_I1_J, axiom,
    ((![A : nat]: (~ ((ord_less_nat @ A @ A)))))). % verit_comp_simplify1(1)
thf(fact_104_verit__comp__simplify1_I1_J, axiom,
    ((![A : int]: (~ ((ord_less_int @ A @ A)))))). % verit_comp_simplify1(1)
thf(fact_105_int__if, axiom,
    ((![P : $o, A : nat, B2 : nat]: ((P => ((semiri2019852685at_int @ (if_nat @ P @ A @ B2)) = (semiri2019852685at_int @ A))) & ((~ (P)) => ((semiri2019852685at_int @ (if_nat @ P @ A @ B2)) = (semiri2019852685at_int @ B2))))))). % int_if
thf(fact_106_nat__int__comparison_I1_J, axiom,
    (((^[Y2 : nat]: (^[Z : nat]: (Y2 = Z))) = (^[A4 : nat]: (^[B : nat]: ((semiri2019852685at_int @ A4) = (semiri2019852685at_int @ B))))))). % nat_int_comparison(1)
thf(fact_107_neg__int__cases, axiom,
    ((![K : int]: ((ord_less_int @ K @ zero_zero_int) => (~ ((![N2 : nat]: ((K = (uminus_uminus_int @ (semiri2019852685at_int @ N2))) => (~ ((ord_less_nat @ zero_zero_nat @ N2))))))))))). % neg_int_cases
thf(fact_108_zero__less__nat__eq, axiom,
    ((![Z2 : int]: ((ord_less_nat @ zero_zero_nat @ (nat2 @ Z2)) = (ord_less_int @ zero_zero_int @ Z2))))). % zero_less_nat_eq
thf(fact_109_Apps__dB__induct, axiom,
    ((![P : dB > $o, T : dB]: ((![N2 : nat, Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U5 : dB]: ((P @ U5) => (![Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (abs @ U5) @ Ts2)))))) => (P @ T)))))). % Apps_dB_induct
thf(fact_110_add_Oinverse__inverse, axiom,
    ((![A : int]: ((uminus_uminus_int @ (uminus_uminus_int @ A)) = A)))). % add.inverse_inverse
thf(fact_111_neg__equal__iff__equal, axiom,
    ((![A : int, B2 : int]: (((uminus_uminus_int @ A) = (uminus_uminus_int @ B2)) = (A = B2))))). % neg_equal_iff_equal
thf(fact_112_add_Oinverse__neutral, axiom,
    (((uminus_uminus_int @ zero_zero_int) = zero_zero_int))). % add.inverse_neutral
thf(fact_113_neg__0__equal__iff__equal, axiom,
    ((![A : int]: ((zero_zero_int = (uminus_uminus_int @ A)) = (zero_zero_int = A))))). % neg_0_equal_iff_equal
thf(fact_114_neg__equal__0__iff__equal, axiom,
    ((![A : int]: (((uminus_uminus_int @ A) = zero_zero_int) = (A = zero_zero_int))))). % neg_equal_0_iff_equal
thf(fact_115_equal__neg__zero, axiom,
    ((![A : int]: ((A = (uminus_uminus_int @ A)) = (A = zero_zero_int))))). % equal_neg_zero
thf(fact_116_neg__equal__zero, axiom,
    ((![A : int]: (((uminus_uminus_int @ A) = A) = (A = zero_zero_int))))). % neg_equal_zero
thf(fact_117_neg__less__iff__less, axiom,
    ((![B2 : int, A : int]: ((ord_less_int @ (uminus_uminus_int @ B2) @ (uminus_uminus_int @ A)) = (ord_less_int @ A @ B2))))). % neg_less_iff_less
thf(fact_118_nat__int, axiom,
    ((![N : nat]: ((nat2 @ (semiri2019852685at_int @ N)) = N)))). % nat_int
thf(fact_119_neg__less__0__iff__less, axiom,
    ((![A : int]: ((ord_less_int @ (uminus_uminus_int @ A) @ zero_zero_int) = (ord_less_int @ zero_zero_int @ A))))). % neg_less_0_iff_less
thf(fact_120_neg__0__less__iff__less, axiom,
    ((![A : int]: ((ord_less_int @ zero_zero_int @ (uminus_uminus_int @ A)) = (ord_less_int @ A @ zero_zero_int))))). % neg_0_less_iff_less
thf(fact_121_neg__less__pos, axiom,
    ((![A : int]: ((ord_less_int @ (uminus_uminus_int @ A) @ A) = (ord_less_int @ zero_zero_int @ A))))). % neg_less_pos
thf(fact_122_less__neg__neg, axiom,
    ((![A : int]: ((ord_less_int @ A @ (uminus_uminus_int @ A)) = (ord_less_int @ A @ zero_zero_int))))). % less_neg_neg
thf(fact_123_negative__eq__positive, axiom,
    ((![N : nat, M : nat]: (((uminus_uminus_int @ (semiri2019852685at_int @ N)) = (semiri2019852685at_int @ M)) = (((N = zero_zero_nat)) & ((M = zero_zero_nat))))))). % negative_eq_positive
thf(fact_124_zless__nat__conj, axiom,
    ((![W : int, Z2 : int]: ((ord_less_nat @ (nat2 @ W) @ (nat2 @ Z2)) = (((ord_less_int @ zero_zero_int @ Z2)) & ((ord_less_int @ W @ Z2))))))). % zless_nat_conj
thf(fact_125_nat__zminus__int, axiom,
    ((![N : nat]: ((nat2 @ (uminus_uminus_int @ (semiri2019852685at_int @ N))) = zero_zero_nat)))). % nat_zminus_int
thf(fact_126_nat__zero__as__int, axiom,
    ((zero_zero_nat = (nat2 @ zero_zero_int)))). % nat_zero_as_int
thf(fact_127_verit__negate__coefficient_I2_J, axiom,
    ((![A : int, B2 : int]: ((ord_less_int @ A @ B2) => (ord_less_int @ (uminus_uminus_int @ B2) @ (uminus_uminus_int @ A)))))). % verit_negate_coefficient(2)
thf(fact_128_equation__minus__iff, axiom,
    ((![A : int, B2 : int]: ((A = (uminus_uminus_int @ B2)) = (B2 = (uminus_uminus_int @ A)))))). % equation_minus_iff
thf(fact_129_minus__equation__iff, axiom,
    ((![A : int, B2 : int]: (((uminus_uminus_int @ A) = B2) = ((uminus_uminus_int @ B2) = A))))). % minus_equation_iff
thf(fact_130_less__minus__iff, axiom,
    ((![A : int, B2 : int]: ((ord_less_int @ A @ (uminus_uminus_int @ B2)) = (ord_less_int @ B2 @ (uminus_uminus_int @ A)))))). % less_minus_iff
thf(fact_131_minus__less__iff, axiom,
    ((![A : int, B2 : int]: ((ord_less_int @ (uminus_uminus_int @ A) @ B2) = (ord_less_int @ (uminus_uminus_int @ B2) @ A))))). % minus_less_iff
thf(fact_132_int__cases2, axiom,
    ((![Z2 : int]: ((![N2 : nat]: (~ ((Z2 = (semiri2019852685at_int @ N2))))) => (~ ((![N2 : nat]: (~ ((Z2 = (uminus_uminus_int @ (semiri2019852685at_int @ N2)))))))))))). % int_cases2
thf(fact_133_not__int__zless__negative, axiom,
    ((![N : nat, M : nat]: (~ ((ord_less_int @ (semiri2019852685at_int @ N) @ (uminus_uminus_int @ (semiri2019852685at_int @ M)))))))). % not_int_zless_negative
thf(fact_134_nat__mono__iff, axiom,
    ((![Z2 : int, W : int]: ((ord_less_int @ zero_zero_int @ Z2) => ((ord_less_nat @ (nat2 @ W) @ (nat2 @ Z2)) = (ord_less_int @ W @ Z2)))))). % nat_mono_iff
thf(fact_135_zless__nat__eq__int__zless, axiom,
    ((![M : nat, Z2 : int]: ((ord_less_nat @ M @ (nat2 @ Z2)) = (ord_less_int @ (semiri2019852685at_int @ M) @ Z2))))). % zless_nat_eq_int_zless
thf(fact_136_int__cases4, axiom,
    ((![M : int]: ((![N2 : nat]: (~ ((M = (semiri2019852685at_int @ N2))))) => (~ ((![N2 : nat]: ((ord_less_nat @ zero_zero_nat @ N2) => (~ ((M = (uminus_uminus_int @ (semiri2019852685at_int @ N2))))))))))))). % int_cases4
thf(fact_137_split__nat, axiom,
    ((![P : nat > $o, I : int]: ((P @ (nat2 @ I)) = (((![N3 : nat]: (((I = (semiri2019852685at_int @ N3))) => ((P @ N3))))) & ((((ord_less_int @ I @ zero_zero_int)) => ((P @ zero_zero_nat))))))))). % split_nat
thf(fact_138_int__cases3, axiom,
    ((![K : int]: ((~ ((K = zero_zero_int))) => ((![N2 : nat]: ((K = (semiri2019852685at_int @ N2)) => (~ ((ord_less_nat @ zero_zero_nat @ N2))))) => (~ ((![N2 : nat]: ((K = (uminus_uminus_int @ (semiri2019852685at_int @ N2))) => (~ ((ord_less_nat @ zero_zero_nat @ N2)))))))))))). % int_cases3
thf(fact_139_in__listspI, axiom,
    ((![Xs : list_dB, A5 : dB > $o]: ((![X : dB]: ((member_dB @ X @ (set_dB2 @ Xs)) => (A5 @ X))) => (listsp_dB @ A5 @ Xs))))). % in_listspI
thf(fact_140_lem, axiom,
    ((![P : dB > $o, T : dB, N : nat]: ((![N2 : nat, Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U5 : dB]: ((P @ U5) => (![Ts2 : list_dB]: ((![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Ts2)) => (P @ X6))) => (P @ (foldl_dB_dB @ app @ (abs @ U5) @ Ts2)))))) => (((size_size_dB @ T) = N) => (P @ T))))))). % lem
thf(fact_141_size__neq__size__imp__neq, axiom,
    ((![X4 : dB, Y : dB]: ((~ (((size_size_dB @ X4) = (size_size_dB @ Y)))) => (~ ((X4 = Y))))))). % size_neq_size_imp_neq
thf(fact_142_dB_Osize_I4_J, axiom,
    ((![X12 : nat]: ((size_size_dB @ (var @ X12)) = zero_zero_nat)))). % dB.size(4)
thf(fact_143_foldl__cong, axiom,
    ((![A : dB, B2 : dB, L : list_dB, K : list_dB, F : dB > dB > dB, G : dB > dB > dB]: ((A = B2) => ((L = K) => ((![A6 : dB, X : dB]: ((member_dB @ X @ (set_dB2 @ L)) => ((F @ A6 @ X) = (G @ A6 @ X)))) => ((foldl_dB_dB @ F @ A @ L) = (foldl_dB_dB @ G @ B2 @ K)))))))). % foldl_cong
thf(fact_144_in__listsp__conv__set, axiom,
    ((listsp_dB = (^[A7 : dB > $o]: (^[Xs2 : list_dB]: (![X5 : dB]: (((member_dB @ X5 @ (set_dB2 @ Xs2))) => ((A7 @ X5))))))))). % in_listsp_conv_set
thf(fact_145_in__listspD, axiom,
    ((![A5 : dB > $o, Xs : list_dB]: ((listsp_dB @ A5 @ Xs) => (![X6 : dB]: ((member_dB @ X6 @ (set_dB2 @ Xs)) => (A5 @ X6))))))). % in_listspD

% Helper facts (3)
thf(help_If_3_1_If_001t__Nat__Onat_T, axiom,
    ((![P : $o]: ((P = $true) | (P = $false))))).
thf(help_If_2_1_If_001t__Nat__Onat_T, axiom,
    ((![X4 : nat, Y : nat]: ((if_nat @ $false @ X4 @ Y) = Y)))).
thf(help_If_1_1_If_001t__Nat__Onat_T, axiom,
    ((![X4 : nat, Y : nat]: ((if_nat @ $true @ X4 @ Y) = X4)))).

% Conjectures (1)
thf(conj_0, conjecture,
    ((it @ t2))).
