%   ORIGINAL: h4/rich__list/EXISTS__DISJ
% 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/OR__CLAUSES_c2: !t. F \/ t <=> t
% Assm: h4/bool/IMP__CLAUSES_c4: !t. t ==> F <=> ~t
% Assm: h4/bool/NOT__CLAUSES_c0: !t. ~ ~t <=> t
% Assm: h4/bool/NOT__CLAUSES_c2: ~F <=> T
% Assm: h4/bool/REFL__CLAUSE: !x. x = x <=> T
% Assm: h4/bool/EQ__CLAUSES_c1: !t. (t <=> T) <=> t
% Assm: h4/bool/EQ__CLAUSES_c2: !t. (F <=> t) <=> ~t
% Assm: h4/bool/LEFT__OR__OVER__AND: !C B A. A \/ B /\ C <=> (A \/ B) /\ (A \/ C)
% 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/pth__ni1: !q p. ~(p ==> q) ==> p
% Assm: h4/sat/pth__ni2: !q p. ~(p ==> q) ==> ~q
% Assm: h4/combin/S__DEF: h4/combin/S = (\f g x. f x (g x))
% Assm: h4/combin/o__DEF: !g f. h4/combin/o f g = (\x. f (g x))
% Assm: h4/list/EXISTS__DEF_c0: !P. h4/list/EXISTS P h4/list/NIL <=> F
% Assm: h4/list/EXISTS__DEF_c1: !t h P. h4/list/EXISTS P (h4/list/CONS h t) <=> P h \/ h4/list/EXISTS P t
% Assm: h4/list/list__induction: !P. P h4/list/NIL /\ (!t. P t ==> (!h. P (h4/list/CONS h t))) ==> (!l. P l)
% Goal: !l Q P. h4/list/EXISTS (\x. P x \/ Q x) l <=> h4/list/EXISTS P l \/ h4/list/EXISTS Q l
%   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_ORu_u_CLAUSESu_c2]: !t. F \/ 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_NOTu_u_CLAUSESu_c2]: ~F <=> 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_EQu_u_CLAUSESu_c2]: !t. (F <=> t) <=> ~t
% Assm [h4s_bools_LEFTu_u_ORu_u_OVERu_u_AND]: !C B A. A \/ B /\ C <=> (A \/ B) /\ (A \/ C)
% 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_pthu_u_ni1]: !q p. ~(p ==> q) ==> p
% Assm [h4s_sats_pthu_u_ni2]: !q p. ~(p ==> q) ==> ~q
% Assm [h4s_combins_Su_u_DEF]: !x x x. h4/combin/S x x x = happ (happ x x) (happ x x)
% Assm [h4s_combins_ou_u_DEF]: !g f x. h4/combin/o f g x = happ f (happ g x)
% Assm [h4s_lists_EXISTSu_u_DEFu_c0]: !P. h4/list/EXISTS P h4/list/NIL <=> F
% Assm [h4s_lists_EXISTSu_u_DEFu_c1]: !t h P. h4/list/EXISTS P (h4/list/CONS h t) <=> happ P h \/ h4/list/EXISTS P t
% Assm [h4s_lists_listu_u_induction]: !P. happ P h4/list/NIL /\ (!t. happ P t ==> (!h. happ P (h4/list/CONS h t))) ==> (!l. happ P l)
% Goal: !_0. (!P Q x. happ (happ (happ _0 P) Q) x <=> happ P x \/ happ Q x) ==> (!l Q P. h4/list/EXISTS (happ (happ _0 P) Q) l <=> h4/list/EXISTS P l \/ h4/list/EXISTS Q l)
fof(aHLu_TRUTH, axiom, p(s(t_bool,t))).
fof(aHLu_FALSITY, axiom, ~ (p(s(t_bool,f)))).
fof(aHLu_BOOLu_CASES, axiom, ![V_t]: (s(t_bool,V_t) = s(t_bool,t) | s(t_bool,V_t) = s(t_bool,f))).
fof(aHLu_EXT, axiom, ![TV_Q160083,TV_Q160079]: ![V_f, V_g]: (![V_x]: s(TV_Q160079,happ(s(t_fun(TV_Q160083,TV_Q160079),V_f),s(TV_Q160083,V_x))) = s(TV_Q160079,happ(s(t_fun(TV_Q160083,TV_Q160079),V_g),s(TV_Q160083,V_x))) => s(t_fun(TV_Q160083,TV_Q160079),V_f) = s(t_fun(TV_Q160083,TV_Q160079),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,t))).
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_ORu_u_CLAUSESu_c2, axiom, ![V_t]: ((p(s(t_bool,f)) | 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_NOTu_u_CLAUSESu_c2, axiom, (~ (p(s(t_bool,f))) <=> p(s(t_bool,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,t)))).
fof(ah4s_bools_EQu_u_CLAUSESu_c1, axiom, ![V_t]: (s(t_bool,V_t) = s(t_bool,t) <=> p(s(t_bool,V_t)))).
fof(ah4s_bools_EQu_u_CLAUSESu_c2, axiom, ![V_t]: (s(t_bool,f) = s(t_bool,V_t) <=> ~ (p(s(t_bool,V_t))))).
fof(ah4s_bools_LEFTu_u_ORu_u_OVERu_u_AND, axiom, ![V_C, V_B, V_A]: ((p(s(t_bool,V_A)) | (p(s(t_bool,V_B)) & p(s(t_bool,V_C)))) <=> ((p(s(t_bool,V_A)) | p(s(t_bool,V_B))) & (p(s(t_bool,V_A)) | p(s(t_bool,V_C)))))).
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_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_Su_u_DEF, axiom, ![TV_u_27c,TV_u_27b,TV_u_27a]: ![V_x, V_x0, V_x1]: s(TV_u_27c,h4s_combins_s(s(t_fun(TV_u_27a,t_fun(TV_u_27b,TV_u_27c)),V_x),s(t_fun(TV_u_27a,TV_u_27b),V_x0),s(TV_u_27a,V_x1))) = s(TV_u_27c,happ(s(t_fun(TV_u_27b,TV_u_27c),happ(s(t_fun(TV_u_27a,t_fun(TV_u_27b,TV_u_27c)),V_x),s(TV_u_27a,V_x1))),s(TV_u_27b,happ(s(t_fun(TV_u_27a,TV_u_27b),V_x0),s(TV_u_27a,V_x1)))))).
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,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_lists_EXISTSu_u_DEFu_c0, axiom, ![TV_u_27a]: ![V_P]: s(t_bool,h4s_lists_exists(s(t_fun(TV_u_27a,t_bool),V_P),s(t_h4s_lists_list(TV_u_27a),h4s_lists_nil))) = s(t_bool,f)).
fof(ah4s_lists_EXISTSu_u_DEFu_c1, axiom, ![TV_u_27a]: ![V_t, V_h, V_P]: (p(s(t_bool,h4s_lists_exists(s(t_fun(TV_u_27a,t_bool),V_P),s(t_h4s_lists_list(TV_u_27a),h4s_lists_cons(s(TV_u_27a,V_h),s(t_h4s_lists_list(TV_u_27a),V_t)))))) <=> (p(s(t_bool,happ(s(t_fun(TV_u_27a,t_bool),V_P),s(TV_u_27a,V_h)))) | p(s(t_bool,h4s_lists_exists(s(t_fun(TV_u_27a,t_bool),V_P),s(t_h4s_lists_list(TV_u_27a),V_t))))))).
fof(ah4s_lists_listu_u_induction, axiom, ![TV_u_27a]: ![V_P]: ((p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(TV_u_27a),t_bool),V_P),s(t_h4s_lists_list(TV_u_27a),h4s_lists_nil)))) & ![V_t]: (p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(TV_u_27a),t_bool),V_P),s(t_h4s_lists_list(TV_u_27a),V_t)))) => ![V_h]: p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(TV_u_27a),t_bool),V_P),s(t_h4s_lists_list(TV_u_27a),h4s_lists_cons(s(TV_u_27a,V_h),s(t_h4s_lists_list(TV_u_27a),V_t)))))))) => ![V_l]: p(s(t_bool,happ(s(t_fun(t_h4s_lists_list(TV_u_27a),t_bool),V_P),s(t_h4s_lists_list(TV_u_27a),V_l)))))).
fof(ch4s_richu_u_lists_EXISTSu_u_DISJ, conjecture, ![TV_u_27a]: ![V_uu_0]: (![V_P, V_Q, V_x]: (p(s(t_bool,happ(s(t_fun(TV_u_27a,t_bool),happ(s(t_fun(t_fun(TV_u_27a,t_bool),t_fun(TV_u_27a,t_bool)),happ(s(t_fun(t_fun(TV_u_27a,t_bool),t_fun(t_fun(TV_u_27a,t_bool),t_fun(TV_u_27a,t_bool))),V_uu_0),s(t_fun(TV_u_27a,t_bool),V_P))),s(t_fun(TV_u_27a,t_bool),V_Q))),s(TV_u_27a,V_x)))) <=> (p(s(t_bool,happ(s(t_fun(TV_u_27a,t_bool),V_P),s(TV_u_27a,V_x)))) | p(s(t_bool,happ(s(t_fun(TV_u_27a,t_bool),V_Q),s(TV_u_27a,V_x)))))) => ![V_l, V_Q, V_P]: (p(s(t_bool,h4s_lists_exists(s(t_fun(TV_u_27a,t_bool),happ(s(t_fun(t_fun(TV_u_27a,t_bool),t_fun(TV_u_27a,t_bool)),happ(s(t_fun(t_fun(TV_u_27a,t_bool),t_fun(t_fun(TV_u_27a,t_bool),t_fun(TV_u_27a,t_bool))),V_uu_0),s(t_fun(TV_u_27a,t_bool),V_P))),s(t_fun(TV_u_27a,t_bool),V_Q))),s(t_h4s_lists_list(TV_u_27a),V_l)))) <=> (p(s(t_bool,h4s_lists_exists(s(t_fun(TV_u_27a,t_bool),V_P),s(t_h4s_lists_list(TV_u_27a),V_l)))) | p(s(t_bool,h4s_lists_exists(s(t_fun(TV_u_27a,t_bool),V_Q),s(t_h4s_lists_list(TV_u_27a),V_l)))))))).
