% 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_65__5209884_1 ) ; }
% This file was generated by Isabelle (most likely Sledgehammer)
% 2020-12-16 14:37:13.356

% Could-be-implicit typings (5)
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__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 (33)
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_Lambda_Obeta, type,
    beta : dB > dB > $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_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_ListOrder_Ostep1_001t__Lambda__OdB, type,
    step1_dB : (dB > dB > $o) > list_dB > list_dB > $o).
thf(sy_c_List_Obind_001t__Lambda__OdB_001t__Lambda__OdB, type,
    bind_dB_dB : list_dB > (dB > list_dB) > list_dB).
thf(sy_c_List_Ocan__select_001t__Lambda__OdB, type,
    can_select_dB : (dB > $o) > set_dB > $o).
thf(sy_c_List_Ocount__list_001t__Lambda__OdB, type,
    count_list_dB : list_dB > dB > nat).
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_Ogen__length_001t__Lambda__OdB, type,
    gen_length_dB : nat > list_dB > nat).
thf(sy_c_List_Olist_ONil_001t__Lambda__OdB, type,
    nil_dB : list_dB).
thf(sy_c_List_Olist_Oset_001t__Lambda__OdB, type,
    set_dB2 : list_dB > set_dB).
thf(sy_c_List_Olist__ex1_001t__Lambda__OdB, type,
    list_ex1_dB : (dB > $o) > list_dB > $o).
thf(sy_c_List_Olistsp_001t__Lambda__OdB, type,
    listsp_dB : (dB > $o) > list_dB > $o).
thf(sy_c_List_Omaps_001t__Lambda__OdB_001t__Lambda__OdB, type,
    maps_dB_dB : (dB > list_dB) > list_dB > list_dB).
thf(sy_c_List_Omember_001t__Lambda__OdB, type,
    member_dB : list_dB > 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_Nat_Osize__class_Osize_001t__List__Olist_It__Lambda__OdB_J, type,
    size_size_list_dB : list_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_dB2 : dB > set_dB > $o).
thf(sy_v_n, type,
    n : nat).

% Relevant facts (144)
thf(fact_0_Var__eq__apps__conv, axiom,
    ((![M : nat, S : dB, Ss : list_dB]: (((var @ M) = (foldl_dB_dB @ app @ S @ Ss)) = ((((var @ M) = S)) & ((Ss = nil_dB))))))). % Var_eq_apps_conv
thf(fact_1_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_2_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_3_dB_Oinject_I1_J, axiom,
    ((![X1 : nat, Y1 : nat]: (((var @ X1) = (var @ Y1)) = (X1 = Y1))))). % dB.inject(1)
thf(fact_4_dB_Oinject_I2_J, axiom,
    ((![X21 : dB, X22 : dB, Y21 : dB, Y22 : dB]: (((app @ X21 @ X22) = (app @ Y21 @ Y22)) = (((X21 = Y21)) & ((X22 = Y22))))))). % dB.inject(2)
thf(fact_5_dB_Odistinct_I1_J, axiom,
    ((![X1 : nat, X21 : dB, X22 : dB]: (~ (((var @ X1) = (app @ X21 @ X22))))))). % dB.distinct(1)
thf(fact_6_foldl__Nil, axiom,
    ((![F : dB > dB > dB, A : dB]: ((foldl_dB_dB @ F @ A @ nil_dB) = A)))). % foldl_Nil
thf(fact_7_IT_OVar, axiom,
    ((![Rs : list_dB, N : nat]: ((listsp_dB @ it @ Rs) => (it @ (foldl_dB_dB @ app @ (var @ N) @ Rs)))))). % IT.Var
thf(fact_8_Abs__eq__apps__conv, axiom,
    ((![R : dB, S : dB, Ss : list_dB]: (((abs @ R) = (foldl_dB_dB @ app @ S @ Ss)) = ((((abs @ R) = S)) & ((Ss = nil_dB))))))). % Abs_eq_apps_conv
thf(fact_9_apps__eq__Abs__conv, axiom,
    ((![S : dB, Ss : list_dB, R : dB]: (((foldl_dB_dB @ app @ S @ Ss) = (abs @ R)) = (((S = (abs @ R))) & ((Ss = nil_dB))))))). % apps_eq_Abs_conv
thf(fact_10_subst__Var__IT, axiom,
    ((![R : dB, I : nat, J : nat]: ((it @ R) => (it @ (subst @ R @ (var @ I) @ J)))))). % subst_Var_IT
thf(fact_11_dB_Oinject_I3_J, axiom,
    ((![X3 : dB, Y3 : dB]: (((abs @ X3) = (abs @ Y3)) = (X3 = Y3))))). % dB.inject(3)
thf(fact_12_listsp__simps_I1_J, axiom,
    ((![A2 : dB > $o]: (listsp_dB @ A2 @ nil_dB)))). % listsp_simps(1)
thf(fact_13_subst__eq, axiom,
    ((![K : nat, U : dB]: ((subst @ (var @ K) @ U @ K) = U)))). % subst_eq
thf(fact_14_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_15_listsp_ONil, axiom,
    ((![A2 : dB > $o]: (listsp_dB @ A2 @ nil_dB)))). % listsp.Nil
thf(fact_16_dB_Odistinct_I5_J, axiom,
    ((![X21 : dB, X22 : dB, X3 : dB]: (~ (((app @ X21 @ X22) = (abs @ X3))))))). % dB.distinct(5)
thf(fact_17_subst__App, axiom,
    ((![T : dB, U : dB, S : dB, K : nat]: ((subst @ (app @ T @ U) @ S @ K) = (app @ (subst @ T @ S @ K) @ (subst @ U @ S @ K)))))). % subst_App
thf(fact_18_dB_Odistinct_I3_J, axiom,
    ((![X1 : nat, X3 : dB]: (~ (((var @ X1) = (abs @ X3))))))). % dB.distinct(3)
thf(fact_19_Lambda, axiom,
    ((![R : dB]: ((it @ R) => (it @ (abs @ R)))))). % Lambda
thf(fact_20_dB_Oexhaust, axiom,
    ((![Y : dB]: ((![X12 : nat]: (~ ((Y = (var @ X12))))) => ((![X212 : dB, X222 : dB]: (~ ((Y = (app @ X212 @ X222))))) => (~ ((![X32 : dB]: (~ ((Y = (abs @ X32)))))))))))). % dB.exhaust
thf(fact_21_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_22_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_23_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_24_ex__head__tail, axiom,
    ((![T : dB]: (?[Ts2 : list_dB, H : dB]: ((T = (foldl_dB_dB @ app @ H @ Ts2)) & ((?[N2 : nat]: (H = (var @ N2))) | (?[U2 : dB]: (H = (abs @ U2))))))))). % ex_head_tail
thf(fact_25_IT_Osimps, axiom,
    ((it = (^[A3 : dB]: (((?[Rs2 : list_dB]: (?[N3 : nat]: (((A3 = (foldl_dB_dB @ app @ (var @ N3) @ Rs2))) & ((listsp_dB @ it @ Rs2)))))) | ((((?[R2 : dB]: (((A3 = (abs @ R2))) & ((it @ R2))))) | ((?[R2 : dB]: (?[S2 : dB]: (?[Ss2 : list_dB]: (((A3 = (foldl_dB_dB @ app @ (app @ (abs @ R2) @ S2) @ Ss2))) & ((((it @ (foldl_dB_dB @ app @ (subst @ R2 @ S2 @ zero_zero_nat) @ Ss2))) & ((it @ S2)))))))))))))))). % IT.simps
thf(fact_26_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, S3 : dB, Ss3 : list_dB]: ((A = (foldl_dB_dB @ app @ (app @ (abs @ R3) @ S3) @ Ss3)) => ((it @ (foldl_dB_dB @ app @ (subst @ R3 @ S3 @ zero_zero_nat) @ Ss3)) => (~ ((it @ S3)))))))))))))). % IT.cases
thf(fact_27_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_28_list__ex1__simps_I1_J, axiom,
    ((![P : dB > $o]: (~ ((list_ex1_dB @ P @ nil_dB)))))). % list_ex1_simps(1)
thf(fact_29_Apps__dB__induct, axiom,
    ((![P : dB > $o, T : dB]: ((![N2 : nat, Ts2 : list_dB]: ((![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U2 : dB]: ((P @ U2) => (![Ts2 : list_dB]: ((![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (abs @ U2) @ Ts2)))))) => (P @ T)))))). % Apps_dB_induct
thf(fact_30_bind__simps_I1_J, axiom,
    ((![F : dB > list_dB]: ((bind_dB_dB @ nil_dB @ F) = nil_dB)))). % bind_simps(1)
thf(fact_31_member__rec_I2_J, axiom,
    ((![Y : dB]: (~ ((member_dB @ nil_dB @ Y)))))). % member_rec(2)
thf(fact_32_subst__lt, axiom,
    ((![J : nat, I : nat, U : dB]: ((ord_less_nat @ J @ I) => ((subst @ (var @ J) @ U @ I) = (var @ J)))))). % subst_lt
thf(fact_33_gen__length__code_I1_J, axiom,
    ((![N : nat]: ((gen_length_dB @ N @ nil_dB) = N)))). % gen_length_code(1)
thf(fact_34_maps__simps_I2_J, axiom,
    ((![F : dB > list_dB]: ((maps_dB_dB @ F @ nil_dB) = nil_dB)))). % maps_simps(2)
thf(fact_35_in__listspI, axiom,
    ((![Xs : list_dB, A2 : dB > $o]: ((![X : dB]: ((member_dB2 @ X @ (set_dB2 @ Xs)) => (A2 @ X))) => (listsp_dB @ A2 @ Xs))))). % in_listspI
thf(fact_36_list__ex1__iff, axiom,
    ((list_ex1_dB = (^[P2 : dB > $o]: (^[Xs2 : list_dB]: (?[X5 : dB]: (((((member_dB2 @ X5 @ (set_dB2 @ Xs2))) & ((P2 @ X5)))) & ((![Y2 : dB]: (((((member_dB2 @ Y2 @ (set_dB2 @ Xs2))) & ((P2 @ Y2)))) => ((Y2 = X5)))))))))))). % list_ex1_iff
thf(fact_37_in__set__member, axiom,
    ((![X6 : dB, Xs : list_dB]: ((member_dB2 @ X6 @ (set_dB2 @ Xs)) = (member_dB @ Xs @ X6))))). % in_set_member
thf(fact_38_foldl__cong, axiom,
    ((![A : dB, B : dB, L : list_dB, K : list_dB, F : dB > dB > dB, G : dB > dB > dB]: ((A = B) => ((L = K) => ((![A4 : dB, X : dB]: ((member_dB2 @ X @ (set_dB2 @ L)) => ((F @ A4 @ X) = (G @ A4 @ X)))) => ((foldl_dB_dB @ F @ A @ L) = (foldl_dB_dB @ G @ B @ K)))))))). % foldl_cong
thf(fact_39_in__listsp__conv__set, axiom,
    ((listsp_dB = (^[A5 : dB > $o]: (^[Xs2 : list_dB]: (![X5 : dB]: (((member_dB2 @ X5 @ (set_dB2 @ Xs2))) => ((A5 @ X5))))))))). % in_listsp_conv_set
thf(fact_40_in__listspD, axiom,
    ((![A2 : dB > $o, Xs : list_dB]: ((listsp_dB @ A2 @ Xs) => (![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Xs)) => (A2 @ X4))))))). % in_listspD
thf(fact_41_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_42_less__nat__zero__code, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_nat_zero_code
thf(fact_43_neq0__conv, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) = (ord_less_nat @ zero_zero_nat @ N))))). % neq0_conv
thf(fact_44_not__gr__zero, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr_zero
thf(fact_45_can__select__set__list__ex1, axiom,
    ((![P : dB > $o, A2 : list_dB]: ((can_select_dB @ P @ (set_dB2 @ A2)) = (list_ex1_dB @ P @ A2))))). % can_select_set_list_ex1
thf(fact_46_lem, axiom,
    ((![P : dB > $o, T : dB, N : nat]: ((![N2 : nat, Ts2 : list_dB]: ((![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (var @ N2) @ Ts2)))) => ((![U2 : dB]: ((P @ U2) => (![Ts2 : list_dB]: ((![X4 : dB]: ((member_dB2 @ X4 @ (set_dB2 @ Ts2)) => (P @ X4))) => (P @ (foldl_dB_dB @ app @ (abs @ U2) @ Ts2)))))) => (((size_size_dB @ T) = N) => (P @ T))))))). % lem
thf(fact_47_size__neq__size__imp__neq, axiom,
    ((![X6 : dB, Y : dB]: ((~ (((size_size_dB @ X6) = (size_size_dB @ Y)))) => (~ ((X6 = Y))))))). % size_neq_size_imp_neq
thf(fact_48_zero__reorient, axiom,
    ((![X6 : nat]: ((zero_zero_nat = X6) = (X6 = zero_zero_nat))))). % zero_reorient
thf(fact_49_zero__reorient, axiom,
    ((![X6 : int]: ((zero_zero_int = X6) = (X6 = zero_zero_int))))). % zero_reorient
thf(fact_50_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_51_less__not__refl, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_not_refl
thf(fact_52_less__not__refl2, axiom,
    ((![N : nat, M : nat]: ((ord_less_nat @ N @ M) => (~ ((M = N))))))). % less_not_refl2
thf(fact_53_less__not__refl3, axiom,
    ((![S : nat, T : nat]: ((ord_less_nat @ S @ T) => (~ ((S = T))))))). % less_not_refl3
thf(fact_54_less__irrefl__nat, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ N)))))). % less_irrefl_nat
thf(fact_55_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_56_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_57_linorder__neqE__nat, axiom,
    ((![X6 : nat, Y : nat]: ((~ ((X6 = Y))) => ((~ ((ord_less_nat @ X6 @ Y))) => (ord_less_nat @ Y @ X6)))))). % linorder_neqE_nat
thf(fact_58_dB_Osize_I4_J, axiom,
    ((![X1 : nat]: ((size_size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size(4)
thf(fact_59_gr__zeroI, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr_zeroI
thf(fact_60_not__less__zero, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less_zero
thf(fact_61_gr__implies__not__zero, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not_zero
thf(fact_62_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_63_gr0I, axiom,
    ((![N : nat]: ((~ ((N = zero_zero_nat))) => (ord_less_nat @ zero_zero_nat @ N))))). % gr0I
thf(fact_64_not__gr0, axiom,
    ((![N : nat]: ((~ ((ord_less_nat @ zero_zero_nat @ N))) = (N = zero_zero_nat))))). % not_gr0
thf(fact_65_not__less0, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % not_less0
thf(fact_66_less__zeroE, axiom,
    ((![N : nat]: (~ ((ord_less_nat @ N @ zero_zero_nat)))))). % less_zeroE
thf(fact_67_gr__implies__not0, axiom,
    ((![M : nat, N : nat]: ((ord_less_nat @ M @ N) => (~ ((N = zero_zero_nat))))))). % gr_implies_not0
thf(fact_68_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_69_bot__nat__0_Oextremum__strict, axiom,
    ((![A : nat]: (~ ((ord_less_nat @ A @ zero_zero_nat)))))). % bot_nat_0.extremum_strict
thf(fact_70_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_nat @ zero_zero_nat @ zero_zero_nat))))). % less_numeral_extra(3)
thf(fact_71_less__numeral__extra_I3_J, axiom,
    ((~ ((ord_less_int @ zero_zero_int @ zero_zero_int))))). % less_numeral_extra(3)
thf(fact_72_count__notin, axiom,
    ((![X6 : dB, Xs : list_dB]: ((~ ((member_dB2 @ X6 @ (set_dB2 @ Xs)))) => ((count_list_dB @ Xs @ X6) = zero_zero_nat))))). % count_notin
thf(fact_73_dB_Osize__gen_I1_J, axiom,
    ((![X1 : nat]: ((size_dB @ (var @ X1)) = zero_zero_nat)))). % dB.size_gen(1)
thf(fact_74_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_75_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_76_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_77_beta__cases_I3_J, axiom,
    ((![S : dB, T : dB, U : dB]: ((beta @ (app @ S @ T) @ U) => ((![S3 : dB]: ((S = (abs @ S3)) => (~ ((U = (subst @ S3 @ T @ zero_zero_nat)))))) => ((![T2 : dB]: ((U = (app @ T2 @ T)) => (~ ((beta @ S @ T2))))) => (~ ((![T2 : dB]: ((U = (app @ S @ T2)) => (~ ((beta @ T @ T2))))))))))))). % beta_cases(3)
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_length__0__conv, axiom,
    ((![Xs : list_dB]: (((size_size_list_dB @ Xs) = zero_zero_nat) = (Xs = nil_dB))))). % length_0_conv
thf(fact_80_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_81_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_82_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_83_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_84_of__nat__0, axiom,
    (((semiri1382578993at_nat @ zero_zero_nat) = zero_zero_nat))). % of_nat_0
thf(fact_85_of__nat__0, axiom,
    (((semiri2019852685at_int @ zero_zero_nat) = zero_zero_int))). % of_nat_0
thf(fact_86_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_87_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_88_length__greater__0__conv, axiom,
    ((![Xs : list_dB]: ((ord_less_nat @ zero_zero_nat @ (size_size_list_dB @ Xs)) = (~ ((Xs = nil_dB))))))). % length_greater_0_conv
thf(fact_89_appL, axiom,
    ((![S : dB, T : dB, U : dB]: ((beta @ S @ T) => (beta @ (app @ S @ U) @ (app @ T @ U)))))). % appL
thf(fact_90_appR, axiom,
    ((![S : dB, T : dB, U : dB]: ((beta @ S @ T) => (beta @ (app @ U @ S) @ (app @ U @ T)))))). % appR
thf(fact_91_abs, axiom,
    ((![S : dB, T : dB]: ((beta @ S @ T) => (beta @ (abs @ S) @ (abs @ T)))))). % abs
thf(fact_92_beta__cases_I2_J, axiom,
    ((![R : dB, S : dB]: ((beta @ (abs @ R) @ S) => (~ ((![T2 : dB]: ((S = (abs @ T2)) => (~ ((beta @ R @ T2))))))))))). % beta_cases(2)
thf(fact_93_beta__cases_I1_J, axiom,
    ((![I : nat, T : dB]: (~ ((beta @ (var @ I) @ T)))))). % beta_cases(1)
thf(fact_94_subst__preserves__beta, axiom,
    ((![R : dB, S : dB, T : dB, I : nat]: ((beta @ R @ S) => (beta @ (subst @ R @ T @ I) @ (subst @ S @ T @ I)))))). % subst_preserves_beta
thf(fact_95_of__nat__less__0__iff, axiom,
    ((![M : nat]: (~ ((ord_less_nat @ (semiri1382578993at_nat @ M) @ zero_zero_nat)))))). % of_nat_less_0_iff
thf(fact_96_of__nat__less__0__iff, axiom,
    ((![M : nat]: (~ ((ord_less_int @ (semiri2019852685at_int @ M) @ zero_zero_int)))))). % of_nat_less_0_iff
thf(fact_97_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_98_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_99_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_100_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_101_list_Osize_I3_J, axiom,
    (((size_size_list_dB @ nil_dB) = zero_zero_nat))). % list.size(3)
thf(fact_102_substn_Osimps_I2_J, axiom,
    ((![T : dB, U : dB, S : dB, K : nat]: ((substn @ (app @ T @ U) @ S @ K) = (app @ (substn @ T @ S @ K) @ (substn @ U @ S @ K)))))). % substn.simps(2)
thf(fact_103_length__pos__if__in__set, axiom,
    ((![X6 : dB, Xs : list_dB]: ((member_dB2 @ X6 @ (set_dB2 @ Xs)) => (ord_less_nat @ zero_zero_nat @ (size_size_list_dB @ Xs)))))). % length_pos_if_in_set
thf(fact_104_count__list_Osimps_I1_J, axiom,
    ((![Y : dB]: ((count_list_dB @ nil_dB @ Y) = zero_zero_nat)))). % count_list.simps(1)
thf(fact_105_beta_Oinducts, axiom,
    ((![X1 : dB, X23 : dB, P : dB > dB > $o]: ((beta @ X1 @ X23) => ((![S3 : dB, T2 : dB]: (P @ (app @ (abs @ S3) @ T2) @ (subst @ S3 @ T2 @ zero_zero_nat))) => ((![S3 : dB, T2 : dB, U2 : dB]: ((beta @ S3 @ T2) => ((P @ S3 @ T2) => (P @ (app @ S3 @ U2) @ (app @ T2 @ U2))))) => ((![S3 : dB, T2 : dB, U2 : dB]: ((beta @ S3 @ T2) => ((P @ S3 @ T2) => (P @ (app @ U2 @ S3) @ (app @ U2 @ T2))))) => ((![S3 : dB, T2 : dB]: ((beta @ S3 @ T2) => ((P @ S3 @ T2) => (P @ (abs @ S3) @ (abs @ T2))))) => (P @ X1 @ X23))))))))). % beta.inducts
thf(fact_106_beta_Osimps, axiom,
    ((beta = (^[A1 : dB]: (^[A22 : dB]: (((?[S2 : dB]: (?[T3 : dB]: (((A1 = (app @ (abs @ S2) @ T3))) & ((A22 = (subst @ S2 @ T3 @ zero_zero_nat))))))) | ((((?[S2 : dB]: (?[T3 : dB]: (?[U3 : dB]: (((A1 = (app @ S2 @ U3))) & ((((A22 = (app @ T3 @ U3))) & ((beta @ S2 @ T3))))))))) | ((((?[S2 : dB]: (?[T3 : dB]: (?[U3 : dB]: (((A1 = (app @ U3 @ S2))) & ((((A22 = (app @ U3 @ T3))) & ((beta @ S2 @ T3))))))))) | ((?[S2 : dB]: (?[T3 : dB]: (((A1 = (abs @ S2))) & ((((A22 = (abs @ T3))) & ((beta @ S2 @ T3)))))))))))))))))). % beta.simps
thf(fact_107_beta_Ocases, axiom,
    ((![A12 : dB, A23 : dB]: ((beta @ A12 @ A23) => ((![S3 : dB, T2 : dB]: ((A12 = (app @ (abs @ S3) @ T2)) => (~ ((A23 = (subst @ S3 @ T2 @ zero_zero_nat)))))) => ((![S3 : dB, T2 : dB, U2 : dB]: ((A12 = (app @ S3 @ U2)) => ((A23 = (app @ T2 @ U2)) => (~ ((beta @ S3 @ T2)))))) => ((![S3 : dB, T2 : dB, U2 : dB]: ((A12 = (app @ U2 @ S3)) => ((A23 = (app @ U2 @ T2)) => (~ ((beta @ S3 @ T2)))))) => (~ ((![S3 : dB]: ((A12 = (abs @ S3)) => (![T2 : dB]: ((A23 = (abs @ T2)) => (~ ((beta @ S3 @ T2)))))))))))))))). % beta.cases
thf(fact_108_beta, axiom,
    ((![S : dB, T : dB]: (beta @ (app @ (abs @ S) @ T) @ (subst @ S @ T @ zero_zero_nat))))). % beta
thf(fact_109_apps__preserves__beta, axiom,
    ((![R : dB, S : dB, Ss : list_dB]: ((beta @ R @ S) => (beta @ (foldl_dB_dB @ app @ R @ Ss) @ (foldl_dB_dB @ app @ S @ Ss)))))). % apps_preserves_beta
thf(fact_110_substn__subst__n, axiom,
    ((substn = (^[T3 : dB]: (^[S2 : dB]: (^[N3 : nat]: (subst @ T3 @ (liftn @ N3 @ S2 @ zero_zero_nat) @ N3))))))). % substn_subst_n
thf(fact_111_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_112_liftn__0, axiom,
    ((![T : dB, K : nat]: ((liftn @ zero_zero_nat @ T @ K) = T)))). % liftn_0
thf(fact_113_int__int__eq, axiom,
    ((![M : nat, N : nat]: (((semiri2019852685at_int @ M) = (semiri2019852685at_int @ N)) = (M = N))))). % int_int_eq
thf(fact_114_less__int__code_I1_J, axiom,
    ((~ ((ord_less_int @ zero_zero_int @ zero_zero_int))))). % less_int_code(1)
thf(fact_115_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_116_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_117_nat__int__comparison_I2_J, axiom,
    ((ord_less_nat = (^[A3 : nat]: (^[B2 : nat]: (ord_less_int @ (semiri2019852685at_int @ A3) @ (semiri2019852685at_int @ B2))))))). % nat_int_comparison(2)
thf(fact_118_int__ops_I1_J, axiom,
    (((semiri2019852685at_int @ zero_zero_nat) = zero_zero_int))). % int_ops(1)
thf(fact_119_verit__comp__simplify1_I1_J, axiom,
    ((![A : nat]: (~ ((ord_less_nat @ A @ A)))))). % verit_comp_simplify1(1)
thf(fact_120_verit__comp__simplify1_I1_J, axiom,
    ((![A : int]: (~ ((ord_less_int @ A @ A)))))). % verit_comp_simplify1(1)
thf(fact_121_nat__int__comparison_I1_J, axiom,
    (((^[Y4 : nat]: (^[Z : nat]: (Y4 = Z))) = (^[A3 : nat]: (^[B2 : nat]: ((semiri2019852685at_int @ A3) = (semiri2019852685at_int @ B2))))))). % nat_int_comparison(1)
thf(fact_122_int__if, axiom,
    ((![P : $o, A : nat, B : nat]: ((P => ((semiri2019852685at_int @ (if_nat @ P @ A @ B)) = (semiri2019852685at_int @ A))) & ((~ (P)) => ((semiri2019852685at_int @ (if_nat @ P @ A @ B)) = (semiri2019852685at_int @ B))))))). % int_if
thf(fact_123_head__Var__reduction, axiom,
    ((![N : nat, Rs : list_dB, V : dB]: ((beta @ (foldl_dB_dB @ app @ (var @ N) @ Rs) @ V) => (?[Ss3 : list_dB]: ((step1_dB @ beta @ Rs @ Ss3) & (V = (foldl_dB_dB @ app @ (var @ N) @ Ss3)))))))). % head_Var_reduction
thf(fact_124_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_125_neg__equal__iff__equal, axiom,
    ((![A : int, B : int]: (((uminus_uminus_int @ A) = (uminus_uminus_int @ B)) = (A = B))))). % neg_equal_iff_equal
thf(fact_126_add_Oinverse__inverse, axiom,
    ((![A : int]: ((uminus_uminus_int @ (uminus_uminus_int @ A)) = A)))). % add.inverse_inverse
thf(fact_127_neg__equal__zero, axiom,
    ((![A : int]: (((uminus_uminus_int @ A) = A) = (A = zero_zero_int))))). % neg_equal_zero
thf(fact_128_equal__neg__zero, axiom,
    ((![A : int]: ((A = (uminus_uminus_int @ A)) = (A = zero_zero_int))))). % equal_neg_zero
thf(fact_129_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_130_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_131_add_Oinverse__neutral, axiom,
    (((uminus_uminus_int @ zero_zero_int) = zero_zero_int))). % add.inverse_neutral
thf(fact_132_neg__less__iff__less, axiom,
    ((![B : int, A : int]: ((ord_less_int @ (uminus_uminus_int @ B) @ (uminus_uminus_int @ A)) = (ord_less_int @ A @ B))))). % neg_less_iff_less
thf(fact_133_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_134_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_135_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_136_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_137_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_138_verit__negate__coefficient_I2_J, axiom,
    ((![A : int, B : int]: ((ord_less_int @ A @ B) => (ord_less_int @ (uminus_uminus_int @ B) @ (uminus_uminus_int @ A)))))). % verit_negate_coefficient(2)
thf(fact_139_minus__equation__iff, axiom,
    ((![A : int, B : int]: (((uminus_uminus_int @ A) = B) = ((uminus_uminus_int @ B) = A))))). % minus_equation_iff
thf(fact_140_equation__minus__iff, axiom,
    ((![A : int, B : int]: ((A = (uminus_uminus_int @ B)) = (B = (uminus_uminus_int @ A)))))). % equation_minus_iff
thf(fact_141_uminus__int__code_I1_J, axiom,
    (((uminus_uminus_int @ zero_zero_int) = zero_zero_int))). % uminus_int_code(1)
thf(fact_142_minus__less__iff, axiom,
    ((![A : int, B : int]: ((ord_less_int @ (uminus_uminus_int @ A) @ B) = (ord_less_int @ (uminus_uminus_int @ B) @ A))))). % minus_less_iff
thf(fact_143_less__minus__iff, axiom,
    ((![A : int, B : int]: ((ord_less_int @ A @ (uminus_uminus_int @ B)) = (ord_less_int @ B @ (uminus_uminus_int @ A)))))). % less_minus_iff

% 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,
    ((![X6 : nat, Y : nat]: ((if_nat @ $false @ X6 @ Y) = Y)))).
thf(help_If_1_1_If_001t__Nat__Onat_T, axiom,
    ((![X6 : nat, Y : nat]: ((if_nat @ $true @ X6 @ Y) = X6)))).

% Conjectures (1)
thf(conj_0, conjecture,
    ((it @ (foldl_dB_dB @ app @ (var @ n) @ nil_dB)))).
