%   ORIGINAL: h4/lbtree/mem__mindepth
% Assm: HL_TRUTH: T
% Assm: HL_FALSITY: ~F
% Assm: HL_BOOL_CASES: !t. (t <=> T) \/ (t <=> F)
% Assm: HL_EXT: !f g. (!x. f x = g x) ==> f = g
% Assm: h4/bool/ETA__AX: !t. (\x. t x) = t
% Assm: h4/bool/TRUTH: T
% Assm: h4/bool/IMP__ANTISYM__AX: !t2 t1. (t1 ==> t2) ==> (t2 ==> t1) ==> (t1 <=> t2)
% Assm: h4/bool/FORALL__SIMP: !t. (!x. t) <=> t
% Assm: h4/bool/IMP__CLAUSES_c4: !t. t ==> F <=> ~t
% Assm: h4/bool/NOT__CLAUSES_c0: !t. ~ ~t <=> t
% Assm: h4/bool/REFL__CLAUSE: !x. x = x <=> T
% Assm: h4/bool/EQ__CLAUSES_c1: !t. (t <=> T) <=> t
% Assm: h4/bool/COND__RAND: !y x f b. f (h4/bool/COND b x y) = h4/bool/COND b (f x) (f y)
% Assm: h4/sat/NOT__NOT: !t. ~ ~t <=> t
% Assm: h4/sat/AND__INV__IMP: !A. A ==> ~A ==> F
% Assm: h4/sat/OR__DUAL2: !B A. ~(A \/ B) ==> F <=> (A ==> F) ==> ~B ==> F
% Assm: h4/sat/OR__DUAL3: !B A. ~(~A \/ B) ==> F <=> A ==> ~B ==> F
% Assm: h4/sat/AND__INV2: !A. (~A ==> F) ==> (A ==> F) ==> F
% Assm: h4/sat/dc__eq: !r q p. (p <=> q <=> r) <=> (p \/ q \/ r) /\ (p \/ ~r \/ ~q) /\ (q \/ ~r \/ ~p) /\ (r \/ ~q \/ ~p)
% Assm: h4/sat/dc__conj: !r q p. (p <=> q /\ r) <=> (p \/ ~q \/ ~r) /\ (q \/ ~p) /\ (r \/ ~p)
% Assm: h4/sat/dc__disj: !r q p. (p <=> q \/ r) <=> (p \/ ~q) /\ (p \/ ~r) /\ (q \/ r \/ ~p)
% Assm: h4/sat/dc__neg: !q p. (p <=> ~q) <=> (p \/ q) /\ (~q \/ ~p)
% Assm: h4/sat/dc__cond: !s r q p. (p <=> h4/bool/COND q r s) <=> (p \/ q \/ ~s) /\ (p \/ ~r \/ ~q) /\ (p \/ ~r \/ ~s) /\ (~q \/ r \/ ~p) /\ (q \/ s \/ ~p)
% Assm: h4/sat/pth__ni1: !q p. ~(p ==> q) ==> p
% Assm: h4/sat/pth__ni2: !q p. ~(p ==> q) ==> ~q
% Assm: h4/combin/o__DEF: !g f. h4/combin/o f g = (\x. f (g x))
% Assm: h4/combin/I__THM: !x. h4/combin/I x = x
% Assm: h4/combin/I__o__ID_c1: !f. h4/combin/o f h4/combin/I = f
% Assm: h4/lbtree/mindepth__def: !x t. h4/lbtree/mindepth x t = h4/bool/COND (h4/lbtree/mem x t) (h4/option/SOME (h4/while/LEAST (\n. h4/lbtree/depth x t n))) h4/option/NONE
% Goal: !x t. h4/lbtree/mem x t ==> (?n. h4/lbtree/mindepth x t = h4/option/SOME n)
%   PROCESSED
% Assm [HLu_TRUTH]: T
% Assm [HLu_FALSITY]: ~F
% Assm [HLu_BOOLu_CASES]: !t. (t <=> T) \/ (t <=> F)
% Assm [HLu_EXT]: !f g. (!x. happ f x = happ g x) ==> f = g
% Assm [h4s_bools_ETAu_u_AX]: !t x. happ t x = happ t x
% Assm [h4s_bools_TRUTH]: T
% Assm [h4s_bools_IMPu_u_ANTISYMu_u_AX]: !t2 t1. (t1 ==> t2) ==> (t2 ==> t1) ==> (t1 <=> t2)
% Assm [h4s_bools_FORALLu_u_SIMP]: !t. (!x. t) <=> t
% Assm [h4s_bools_IMPu_u_CLAUSESu_c4]: !t. t ==> F <=> ~t
% Assm [h4s_bools_NOTu_u_CLAUSESu_c0]: !t. ~ ~t <=> t
% Assm [h4s_bools_REFLu_u_CLAUSE]: !x. x = x <=> T
% Assm [h4s_bools_EQu_u_CLAUSESu_c1]: !t. (t <=> T) <=> t
% Assm [h4s_bools_CONDu_u_RAND]: !y x f b. happ f (h4/bool/COND b x y) = h4/bool/COND b (happ f x) (happ f y)
% Assm [h4s_sats_NOTu_u_NOT]: !t. ~ ~t <=> t
% Assm [h4s_sats_ANDu_u_INVu_u_IMP]: !A. A ==> ~A ==> F
% Assm [h4s_sats_ORu_u_DUAL2]: !B A. ~(A \/ B) ==> F <=> (A ==> F) ==> ~B ==> F
% Assm [h4s_sats_ORu_u_DUAL3]: !B A. ~(~A \/ B) ==> F <=> A ==> ~B ==> F
% Assm [h4s_sats_ANDu_u_INV2]: !A. (~A ==> F) ==> (A ==> F) ==> F
% Assm [h4s_sats_dcu_u_eq]: !r q p. (p <=> q <=> r) <=> (p \/ q \/ r) /\ (p \/ ~r \/ ~q) /\ (q \/ ~r \/ ~p) /\ (r \/ ~q \/ ~p)
% Assm [h4s_sats_dcu_u_conj]: !r q p. (p <=> q /\ r) <=> (p \/ ~q \/ ~r) /\ (q \/ ~p) /\ (r \/ ~p)
% Assm [h4s_sats_dcu_u_disj]: !r q p. (p <=> q \/ r) <=> (p \/ ~q) /\ (p \/ ~r) /\ (q \/ r \/ ~p)
% Assm [h4s_sats_dcu_u_neg]: !q p. (p <=> ~q) <=> (p \/ q) /\ (~q \/ ~p)
% Assm [h4s_sats_dcu_u_cond]: !s r q p. (p <=> h4/bool/COND q r s) <=> (p \/ q \/ ~s) /\ (p \/ ~r \/ ~q) /\ (p \/ ~r \/ ~s) /\ (~q \/ r \/ ~p) /\ (q \/ s \/ ~p)
% Assm [h4s_sats_pthu_u_ni1]: !q p. ~(p ==> q) ==> p
% Assm [h4s_sats_pthu_u_ni2]: !q p. ~(p ==> q) ==> ~q
% Assm [h4s_combins_ou_u_DEF]: !g f x. happ (h4/combin/o f g) x = happ f (happ g x)
% Assm [h4s_combins_Iu_u_THM]: !x. happ h4/combin/I x = x
% Assm [h4s_combins_Iu_u_ou_u_IDu_c1]: !f. h4/combin/o f h4/combin/I = f
% Assm [h4s_lbtrees_mindepthu_u_def]: !_0. (!x t n. happ (happ (happ _0 x) t) n <=> h4/lbtree/depth x t n) ==> (!x t. h4/lbtree/mindepth x t = h4/bool/COND (h4/lbtree/mem x t) (h4/option/SOME (h4/while/LEAST (happ (happ _0 x) t))) h4/option/NONE)
% Goal: !x t. h4/lbtree/mem x t ==> (?n. h4/lbtree/mindepth x t = h4/option/SOME n)
fof(aHLu_TRUTH, axiom, p(s(t_bool,t0))).
fof(aHLu_FALSITY, axiom, ~ (p(s(t_bool,f)))).
fof(aHLu_BOOLu_CASES, axiom, ![V_t]: (s(t_bool,V_t) = s(t_bool,t0) | s(t_bool,V_t) = s(t_bool,f))).
fof(aHLu_EXT, axiom, ![TV_Q198470,TV_Q198466]: ![V_f, V_g]: (![V_x]: s(TV_Q198466,happ(s(t_fun(TV_Q198470,TV_Q198466),V_f),s(TV_Q198470,V_x))) = s(TV_Q198466,happ(s(t_fun(TV_Q198470,TV_Q198466),V_g),s(TV_Q198470,V_x))) => s(t_fun(TV_Q198470,TV_Q198466),V_f) = s(t_fun(TV_Q198470,TV_Q198466),V_g))).
fof(ah4s_bools_ETAu_u_AX, axiom, ![TV_u_27b,TV_u_27a]: ![V_t, V_x]: s(TV_u_27b,happ(s(t_fun(TV_u_27a,TV_u_27b),V_t),s(TV_u_27a,V_x))) = s(TV_u_27b,happ(s(t_fun(TV_u_27a,TV_u_27b),V_t),s(TV_u_27a,V_x)))).
fof(ah4s_bools_TRUTH, axiom, p(s(t_bool,t0))).
fof(ah4s_bools_IMPu_u_ANTISYMu_u_AX, axiom, ![V_t2, V_t1]: ((p(s(t_bool,V_t1)) => p(s(t_bool,V_t2))) => ((p(s(t_bool,V_t2)) => p(s(t_bool,V_t1))) => s(t_bool,V_t1) = s(t_bool,V_t2)))).
fof(ah4s_bools_FORALLu_u_SIMP, axiom, ![TV_u_27a]: ![V_t]: (![V_x]: p(s(t_bool,V_t)) <=> p(s(t_bool,V_t)))).
fof(ah4s_bools_IMPu_u_CLAUSESu_c4, axiom, ![V_t]: ((p(s(t_bool,V_t)) => p(s(t_bool,f))) <=> ~ (p(s(t_bool,V_t))))).
fof(ah4s_bools_NOTu_u_CLAUSESu_c0, axiom, ![V_t]: (~ (~ (p(s(t_bool,V_t)))) <=> p(s(t_bool,V_t)))).
fof(ah4s_bools_REFLu_u_CLAUSE, axiom, ![TV_u_27a]: ![V_x]: (s(TV_u_27a,V_x) = s(TV_u_27a,V_x) <=> p(s(t_bool,t0)))).
fof(ah4s_bools_EQu_u_CLAUSESu_c1, axiom, ![V_t]: (s(t_bool,V_t) = s(t_bool,t0) <=> p(s(t_bool,V_t)))).
fof(ah4s_bools_CONDu_u_RAND, axiom, ![TV_u_27b,TV_u_27a]: ![V_y, V_x, V_f, V_b]: s(TV_u_27b,happ(s(t_fun(TV_u_27a,TV_u_27b),V_f),s(TV_u_27a,h4s_bools_cond(s(t_bool,V_b),s(TV_u_27a,V_x),s(TV_u_27a,V_y))))) = s(TV_u_27b,h4s_bools_cond(s(t_bool,V_b),s(TV_u_27b,happ(s(t_fun(TV_u_27a,TV_u_27b),V_f),s(TV_u_27a,V_x))),s(TV_u_27b,happ(s(t_fun(TV_u_27a,TV_u_27b),V_f),s(TV_u_27a,V_y)))))).
fof(ah4s_sats_NOTu_u_NOT, axiom, ![V_t]: (~ (~ (p(s(t_bool,V_t)))) <=> p(s(t_bool,V_t)))).
fof(ah4s_sats_ANDu_u_INVu_u_IMP, axiom, ![V_A]: (p(s(t_bool,V_A)) => (~ (p(s(t_bool,V_A))) => p(s(t_bool,f))))).
fof(ah4s_sats_ORu_u_DUAL2, axiom, ![V_B, V_A]: ((~ ((p(s(t_bool,V_A)) | p(s(t_bool,V_B)))) => p(s(t_bool,f))) <=> ((p(s(t_bool,V_A)) => p(s(t_bool,f))) => (~ (p(s(t_bool,V_B))) => p(s(t_bool,f)))))).
fof(ah4s_sats_ORu_u_DUAL3, axiom, ![V_B, V_A]: ((~ ((~ (p(s(t_bool,V_A))) | p(s(t_bool,V_B)))) => p(s(t_bool,f))) <=> (p(s(t_bool,V_A)) => (~ (p(s(t_bool,V_B))) => p(s(t_bool,f)))))).
fof(ah4s_sats_ANDu_u_INV2, axiom, ![V_A]: ((~ (p(s(t_bool,V_A))) => p(s(t_bool,f))) => ((p(s(t_bool,V_A)) => p(s(t_bool,f))) => p(s(t_bool,f))))).
fof(ah4s_sats_dcu_u_eq, axiom, ![V_r, V_q, V_p]: ((p(s(t_bool,V_p)) <=> s(t_bool,V_q) = s(t_bool,V_r)) <=> ((p(s(t_bool,V_p)) | (p(s(t_bool,V_q)) | p(s(t_bool,V_r)))) & ((p(s(t_bool,V_p)) | (~ (p(s(t_bool,V_r))) | ~ (p(s(t_bool,V_q))))) & ((p(s(t_bool,V_q)) | (~ (p(s(t_bool,V_r))) | ~ (p(s(t_bool,V_p))))) & (p(s(t_bool,V_r)) | (~ (p(s(t_bool,V_q))) | ~ (p(s(t_bool,V_p)))))))))).
fof(ah4s_sats_dcu_u_conj, axiom, ![V_r, V_q, V_p]: ((p(s(t_bool,V_p)) <=> (p(s(t_bool,V_q)) & p(s(t_bool,V_r)))) <=> ((p(s(t_bool,V_p)) | (~ (p(s(t_bool,V_q))) | ~ (p(s(t_bool,V_r))))) & ((p(s(t_bool,V_q)) | ~ (p(s(t_bool,V_p)))) & (p(s(t_bool,V_r)) | ~ (p(s(t_bool,V_p)))))))).
fof(ah4s_sats_dcu_u_disj, axiom, ![V_r, V_q, V_p]: ((p(s(t_bool,V_p)) <=> (p(s(t_bool,V_q)) | p(s(t_bool,V_r)))) <=> ((p(s(t_bool,V_p)) | ~ (p(s(t_bool,V_q)))) & ((p(s(t_bool,V_p)) | ~ (p(s(t_bool,V_r)))) & (p(s(t_bool,V_q)) | (p(s(t_bool,V_r)) | ~ (p(s(t_bool,V_p))))))))).
fof(ah4s_sats_dcu_u_neg, axiom, ![V_q, V_p]: ((p(s(t_bool,V_p)) <=> ~ (p(s(t_bool,V_q)))) <=> ((p(s(t_bool,V_p)) | p(s(t_bool,V_q))) & (~ (p(s(t_bool,V_q))) | ~ (p(s(t_bool,V_p))))))).
fof(ah4s_sats_dcu_u_cond, axiom, ![V_s, V_r, V_q, V_p]: (s(t_bool,V_p) = s(t_bool,h4s_bools_cond(s(t_bool,V_q),s(t_bool,V_r),s(t_bool,V_s))) <=> ((p(s(t_bool,V_p)) | (p(s(t_bool,V_q)) | ~ (p(s(t_bool,V_s))))) & ((p(s(t_bool,V_p)) | (~ (p(s(t_bool,V_r))) | ~ (p(s(t_bool,V_q))))) & ((p(s(t_bool,V_p)) | (~ (p(s(t_bool,V_r))) | ~ (p(s(t_bool,V_s))))) & ((~ (p(s(t_bool,V_q))) | (p(s(t_bool,V_r)) | ~ (p(s(t_bool,V_p))))) & (p(s(t_bool,V_q)) | (p(s(t_bool,V_s)) | ~ (p(s(t_bool,V_p))))))))))).
fof(ah4s_sats_pthu_u_ni1, axiom, ![V_q, V_p]: (~ ((p(s(t_bool,V_p)) => p(s(t_bool,V_q)))) => p(s(t_bool,V_p)))).
fof(ah4s_sats_pthu_u_ni2, axiom, ![V_q, V_p]: (~ ((p(s(t_bool,V_p)) => p(s(t_bool,V_q)))) => ~ (p(s(t_bool,V_q))))).
fof(ah4s_combins_ou_u_DEF, axiom, ![TV_u_27b,TV_u_27c,TV_u_27a]: ![V_g, V_f, V_x]: s(TV_u_27b,happ(s(t_fun(TV_u_27a,TV_u_27b),h4s_combins_o(s(t_fun(TV_u_27c,TV_u_27b),V_f),s(t_fun(TV_u_27a,TV_u_27c),V_g))),s(TV_u_27a,V_x))) = s(TV_u_27b,happ(s(t_fun(TV_u_27c,TV_u_27b),V_f),s(TV_u_27c,happ(s(t_fun(TV_u_27a,TV_u_27c),V_g),s(TV_u_27a,V_x)))))).
fof(ah4s_combins_Iu_u_THM, axiom, ![TV_u_27a]: ![V_x]: s(TV_u_27a,happ(s(t_fun(TV_u_27a,TV_u_27a),h4s_combins_i),s(TV_u_27a,V_x))) = s(TV_u_27a,V_x)).
fof(ah4s_combins_Iu_u_ou_u_IDu_c1, axiom, ![TV_u_27a,TV_u_27b]: ![V_f]: s(t_fun(TV_u_27a,TV_u_27b),h4s_combins_o(s(t_fun(TV_u_27a,TV_u_27b),V_f),s(t_fun(TV_u_27a,TV_u_27a),h4s_combins_i))) = s(t_fun(TV_u_27a,TV_u_27b),V_f)).
fof(ah4s_lbtrees_mindepthu_u_def, axiom, ![TV_u_27a]: ![V_uu_0]: (![V_x, V_t, V_n]: s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),happ(s(t_fun(t_h4s_lbtrees_lbtree(TV_u_27a),t_fun(t_h4s_nums_num,t_bool)),happ(s(t_fun(TV_u_27a,t_fun(t_h4s_lbtrees_lbtree(TV_u_27a),t_fun(t_h4s_nums_num,t_bool))),V_uu_0),s(TV_u_27a,V_x))),s(t_h4s_lbtrees_lbtree(TV_u_27a),V_t))),s(t_h4s_nums_num,V_n))) = s(t_bool,h4s_lbtrees_depth(s(TV_u_27a,V_x),s(t_h4s_lbtrees_lbtree(TV_u_27a),V_t),s(t_h4s_nums_num,V_n))) => ![V_x, V_t]: s(t_h4s_options_option(t_h4s_nums_num),h4s_lbtrees_mindepth(s(TV_u_27a,V_x),s(t_h4s_lbtrees_lbtree(TV_u_27a),V_t))) = s(t_h4s_options_option(t_h4s_nums_num),h4s_bools_cond(s(t_bool,h4s_lbtrees_mem(s(TV_u_27a,V_x),s(t_h4s_lbtrees_lbtree(TV_u_27a),V_t))),s(t_h4s_options_option(t_h4s_nums_num),h4s_options_some(s(t_h4s_nums_num,h4s_whiles_least(s(t_fun(t_h4s_nums_num,t_bool),happ(s(t_fun(t_h4s_lbtrees_lbtree(TV_u_27a),t_fun(t_h4s_nums_num,t_bool)),happ(s(t_fun(TV_u_27a,t_fun(t_h4s_lbtrees_lbtree(TV_u_27a),t_fun(t_h4s_nums_num,t_bool))),V_uu_0),s(TV_u_27a,V_x))),s(t_h4s_lbtrees_lbtree(TV_u_27a),V_t))))))),s(t_h4s_options_option(t_h4s_nums_num),h4s_options_none))))).
fof(ch4s_lbtrees_memu_u_mindepth, conjecture, ![TV_u_27a]: ![V_x, V_t]: (p(s(t_bool,h4s_lbtrees_mem(s(TV_u_27a,V_x),s(t_h4s_lbtrees_lbtree(TV_u_27a),V_t)))) => ?[V_n]: s(t_h4s_options_option(t_h4s_nums_num),h4s_lbtrees_mindepth(s(TV_u_27a,V_x),s(t_h4s_lbtrees_lbtree(TV_u_27a),V_t))) = s(t_h4s_options_option(t_h4s_nums_num),h4s_options_some(s(t_h4s_nums_num,V_n))))).
