%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU477^1 : TPTP v6.1.0. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n089.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:32:16 EDT 2014

% Result   : Timeout 300.02s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU477^1 : TPTP v6.1.0. Released v3.6.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n089.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 10:19:26 CDT 2014
% % CPUTime  : 300.02 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% Failed to open /home/cristobal/cocATP/CASC/TPTP/Axioms/SET009^0.ax, trying next directory
% FOF formula (<kernel.Constant object at 0x1948f80>, <kernel.DependentProduct object at 0x180e5f0>) of role type named subrel_type
% Using role type
% Declaring subrel:((fofType->(fofType->Prop))->((fofType->(fofType->Prop))->Prop))
% FOF formula (((eq ((fofType->(fofType->Prop))->((fofType->(fofType->Prop))->Prop))) subrel) (fun (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((S X) Y))))) of role definition named subrel
% A new definition: (((eq ((fofType->(fofType->Prop))->((fofType->(fofType->Prop))->Prop))) subrel) (fun (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((S X) Y)))))
% Defined: subrel:=(fun (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((S X) Y))))
% FOF formula (<kernel.Constant object at 0x1948bd8>, <kernel.DependentProduct object at 0x1948cb0>) of role type named inv_type
% Using role type
% Declaring inv:((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) inv) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((R Y) X))) of role definition named inverse
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) inv) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((R Y) X)))
% Defined: inv:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((R Y) X))
% FOF formula (<kernel.Constant object at 0x1948bd8>, <kernel.DependentProduct object at 0x1d23950>) of role type named idem_type
% Using role type
% Declaring idem:(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)
% FOF formula (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) idem) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), (((eq (fofType->(fofType->Prop))) (F (F R))) (F R))))) of role definition named idempotent
% A new definition: (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) idem) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), (((eq (fofType->(fofType->Prop))) (F (F R))) (F R)))))
% Defined: idem:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), (((eq (fofType->(fofType->Prop))) (F (F R))) (F R))))
% FOF formula (<kernel.Constant object at 0x1d23320>, <kernel.DependentProduct object at 0x1d23050>) of role type named infl_type
% Using role type
% Declaring infl:(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)
% FOF formula (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) infl) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), ((subrel R) (F R))))) of role definition named inflationary
% A new definition: (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) infl) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), ((subrel R) (F R)))))
% Defined: infl:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), ((subrel R) (F R))))
% FOF formula (<kernel.Constant object at 0x1d23950>, <kernel.DependentProduct object at 0x1d239e0>) of role type named mono_type
% Using role type
% Declaring mono:(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)
% FOF formula (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) mono) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop))), (((subrel R) S)->((subrel (F R)) (F S)))))) of role definition named monotonic
% A new definition: (((eq (((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop)) mono) (fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop))), (((subrel R) S)->((subrel (F R)) (F S))))))
% Defined: mono:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop))), (((subrel R) S)->((subrel (F R)) (F S)))))
% FOF formula (<kernel.Constant object at 0x1816cb0>, <kernel.DependentProduct object at 0x1d23908>) of role type named refl_type
% Using role type
% Declaring refl:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) refl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X)))) of role definition named reflexive
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) refl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X))))
% Defined: refl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X)))
% FOF formula (<kernel.Constant object at 0x1816bd8>, <kernel.DependentProduct object at 0x1d23290>) of role type named irrefl_type
% Using role type
% Declaring irrefl:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) irrefl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), (((R X) X)->False)))) of role definition named irreflexive
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) irrefl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), (((R X) X)->False))))
% Defined: irrefl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), (((R X) X)->False)))
% FOF formula (<kernel.Constant object at 0x1d23638>, <kernel.DependentProduct object at 0x1d233b0>) of role type named rc_type
% Using role type
% Declaring rc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) rc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or (((eq fofType) X) Y)) ((R X) Y)))) of role definition named reflexive_closure
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) rc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or (((eq fofType) X) Y)) ((R X) Y))))
% Defined: rc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or (((eq fofType) X) Y)) ((R X) Y)))
% FOF formula (<kernel.Constant object at 0x1d23638>, <kernel.DependentProduct object at 0x1d23320>) of role type named symm_type
% Using role type
% Declaring symm:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) symm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((R Y) X))))) of role definition named symmetric
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) symm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((R Y) X)))))
% Defined: symm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((R Y) X))))
% FOF formula (<kernel.Constant object at 0x1d23950>, <kernel.DependentProduct object at 0x1d23b48>) of role type named antisymm_type
% Using role type
% Declaring antisymm:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) antisymm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((and ((R X) Y)) ((R Y) X))->(((eq fofType) X) Y))))) of role definition named antisymmetric
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) antisymm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((and ((R X) Y)) ((R Y) X))->(((eq fofType) X) Y)))))
% Defined: antisymm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((and ((R X) Y)) ((R Y) X))->(((eq fofType) X) Y))))
% FOF formula (<kernel.Constant object at 0x1d23638>, <kernel.DependentProduct object at 0x1d252d8>) of role type named asymm_type
% Using role type
% Declaring asymm:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) asymm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->(((R Y) X)->False))))) of role definition named asymmetric
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) asymm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->(((R Y) X)->False)))))
% Defined: asymm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->(((R Y) X)->False))))
% FOF formula (<kernel.Constant object at 0x1d23950>, <kernel.DependentProduct object at 0x1d258c0>) of role type named sc_type
% Using role type
% Declaring sc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) sc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or ((R Y) X)) ((R X) Y)))) of role definition named symmetric_closure
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) sc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or ((R Y) X)) ((R X) Y))))
% Defined: sc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or ((R Y) X)) ((R X) Y)))
% FOF formula (<kernel.Constant object at 0x1d25878>, <kernel.DependentProduct object at 0x1d25950>) of role type named trans_type
% Using role type
% Declaring trans:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) trans) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Y)) ((R Y) Z))->((R X) Z))))) of role definition named transitive
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) trans) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Y)) ((R Y) Z))->((R X) Z)))))
% Defined: trans:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Y)) ((R Y) Z))->((R X) Z))))
% FOF formula (<kernel.Constant object at 0x1d25c20>, <kernel.DependentProduct object at 0x1d252d8>) of role type named tc_type
% Using role type
% Declaring tc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) tc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> (forall (S:(fofType->(fofType->Prop))), (((and (trans S)) ((subrel R) S))->((S X) Y))))) of role definition named transitive_closure
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) tc) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> (forall (S:(fofType->(fofType->Prop))), (((and (trans S)) ((subrel R) S))->((S X) Y)))))
% Defined: tc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> (forall (S:(fofType->(fofType->Prop))), (((and (trans S)) ((subrel R) S))->((S X) Y))))
% FOF formula (<kernel.Constant object at 0x192d680>, <kernel.DependentProduct object at 0x192d878>) of role type named trc_type
% Using role type
% Declaring trc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) trc) (fun (R:(fofType->(fofType->Prop)))=> (rc (tc R)))) of role definition named transitive_reflexive_closure
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) trc) (fun (R:(fofType->(fofType->Prop)))=> (rc (tc R))))
% Defined: trc:=(fun (R:(fofType->(fofType->Prop)))=> (rc (tc R)))
% FOF formula (<kernel.Constant object at 0x192d9e0>, <kernel.DependentProduct object at 0x192da70>) of role type named trsc_type
% Using role type
% Declaring trsc:((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) trsc) (fun (R:(fofType->(fofType->Prop)))=> (sc (rc (tc R))))) of role definition named transitive_reflexive_symmetric_closure
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) trsc) (fun (R:(fofType->(fofType->Prop)))=> (sc (rc (tc R)))))
% Defined: trsc:=(fun (R:(fofType->(fofType->Prop)))=> (sc (rc (tc R))))
% FOF formula (<kernel.Constant object at 0x192d9e0>, <kernel.DependentProduct object at 0x192d638>) of role type named po_type
% Using role type
% Declaring po:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) po) (fun (R:(fofType->(fofType->Prop)))=> ((and ((and (refl R)) (antisymm R))) (trans R)))) of role definition named partial_order
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) po) (fun (R:(fofType->(fofType->Prop)))=> ((and ((and (refl R)) (antisymm R))) (trans R))))
% Defined: po:=(fun (R:(fofType->(fofType->Prop)))=> ((and ((and (refl R)) (antisymm R))) (trans R)))
% FOF formula (<kernel.Constant object at 0x192d488>, <kernel.DependentProduct object at 0x192d7e8>) of role type named so_type
% Using role type
% Declaring so:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) so) (fun (R:(fofType->(fofType->Prop)))=> ((and (asymm R)) (trans R)))) of role definition named strict_order
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) so) (fun (R:(fofType->(fofType->Prop)))=> ((and (asymm R)) (trans R))))
% Defined: so:=(fun (R:(fofType->(fofType->Prop)))=> ((and (asymm R)) (trans R)))
% FOF formula (<kernel.Constant object at 0x192d638>, <kernel.DependentProduct object at 0x192d710>) of role type named total_type
% Using role type
% Declaring total:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) total) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((or ((or (((eq fofType) X) Y)) ((R X) Y))) ((R Y) X))))) of role definition named total
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) total) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((or ((or (((eq fofType) X) Y)) ((R X) Y))) ((R Y) X)))))
% Defined: total:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((or ((or (((eq fofType) X) Y)) ((R X) Y))) ((R Y) X))))
% FOF formula (<kernel.Constant object at 0x192d710>, <kernel.DependentProduct object at 0x192dbd8>) of role type named term_type
% Using role type
% Declaring term:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False)))))))))) of role definition named terminating
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False))))))))))
% Defined: term:=(fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False)))))))))
% FOF formula (<kernel.Constant object at 0x192dc68>, <kernel.DependentProduct object at 0x192ddd0>) of role type named ind_type
% Using role type
% Declaring ind:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) ind) (fun (R:(fofType->(fofType->Prop)))=> (forall (P:(fofType->Prop)), ((forall (X:fofType), ((forall (Y:fofType), ((((tc R) X) Y)->(P Y)))->(P X)))->(forall (X:fofType), (P X)))))) of role definition named satisfying_the_induction_principle
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) ind) (fun (R:(fofType->(fofType->Prop)))=> (forall (P:(fofType->Prop)), ((forall (X:fofType), ((forall (Y:fofType), ((((tc R) X) Y)->(P Y)))->(P X)))->(forall (X:fofType), (P X))))))
% Defined: ind:=(fun (R:(fofType->(fofType->Prop)))=> (forall (P:(fofType->Prop)), ((forall (X:fofType), ((forall (Y:fofType), ((((tc R) X) Y)->(P Y)))->(P X)))->(forall (X:fofType), (P X)))))
% FOF formula (<kernel.Constant object at 0x192d560>, <kernel.DependentProduct object at 0x192dc68>) of role type named innf_type
% Using role type
% Declaring innf:((fofType->(fofType->Prop))->(fofType->Prop))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->Prop))) innf) (fun (R:(fofType->(fofType->Prop))) (X:fofType)=> (((ex fofType) (fun (Y:fofType)=> ((R X) Y)))->False))) of role definition named in_normal_form
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->Prop))) innf) (fun (R:(fofType->(fofType->Prop))) (X:fofType)=> (((ex fofType) (fun (Y:fofType)=> ((R X) Y)))->False)))
% Defined: innf:=(fun (R:(fofType->(fofType->Prop))) (X:fofType)=> (((ex fofType) (fun (Y:fofType)=> ((R X) Y)))->False))
% FOF formula (<kernel.Constant object at 0x192ddd0>, <kernel.DependentProduct object at 0x192dea8>) of role type named nfof_type
% Using role type
% Declaring nfof:((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) nfof) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((and (((trc R) Y) X)) ((innf R) X)))) of role definition named normal_form_of
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) nfof) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((and (((trc R) Y) X)) ((innf R) X))))
% Defined: nfof:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((and (((trc R) Y) X)) ((innf R) X)))
% FOF formula (<kernel.Constant object at 0x192d560>, <kernel.DependentProduct object at 0x192d5f0>) of role type named norm_type
% Using role type
% Declaring norm:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) norm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((ex fofType) (fun (Y:fofType)=> (((nfof R) Y) X)))))) of role definition named normalizing
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) norm) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((ex fofType) (fun (Y:fofType)=> (((nfof R) Y) X))))))
% Defined: norm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((ex fofType) (fun (Y:fofType)=> (((nfof R) Y) X)))))
% FOF formula (<kernel.Constant object at 0x192d560>, <kernel.DependentProduct object at 0x192def0>) of role type named join_type
% Using role type
% Declaring join:((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))
% FOF formula (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) join) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((ex fofType) (fun (Z:fofType)=> ((and (((trc R) X) Z)) (((trc R) Y) Z)))))) of role definition named joinable
% A new definition: (((eq ((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))) join) (fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((ex fofType) (fun (Z:fofType)=> ((and (((trc R) X) Z)) (((trc R) Y) Z))))))
% Defined: join:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((ex fofType) (fun (Z:fofType)=> ((and (((trc R) X) Z)) (((trc R) Y) Z)))))
% FOF formula (<kernel.Constant object at 0x192df38>, <kernel.DependentProduct object at 0x1d120e0>) of role type named lconfl_type
% Using role type
% Declaring lconfl:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) lconfl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) ((R X) Y))->(((join R) Z) Y))))) of role definition named locally_confluent
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) lconfl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) ((R X) Y))->(((join R) Z) Y)))))
% Defined: lconfl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) ((R X) Y))->(((join R) Z) Y))))
% FOF formula (<kernel.Constant object at 0x192def0>, <kernel.DependentProduct object at 0x1d12488>) of role type named sconfl_type
% Using role type
% Declaring sconfl:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) sconfl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) (((trc R) X) Y))->(((join R) Z) Y))))) of role definition named semi_confluent
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) sconfl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) (((trc R) X) Y))->(((join R) Z) Y)))))
% Defined: sconfl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) (((trc R) X) Y))->(((join R) Z) Y))))
% FOF formula (<kernel.Constant object at 0x1d12320>, <kernel.DependentProduct object at 0x1d124d0>) of role type named confl_type
% Using role type
% Declaring confl:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) confl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((trc R) X) Z)) (((trc R) X) Y))->(((join R) Z) Y))))) of role definition named confluent
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) confl) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((trc R) X) Z)) (((trc R) X) Y))->(((join R) Z) Y)))))
% Defined: confl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((trc R) X) Z)) (((trc R) X) Y))->(((join R) Z) Y))))
% FOF formula (<kernel.Constant object at 0x1d123f8>, <kernel.DependentProduct object at 0x1d12170>) of role type named cr_type
% Using role type
% Declaring cr:((fofType->(fofType->Prop))->Prop)
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) cr) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((((trsc R) X) Y)->(((join R) X) Y))))) of role definition named church_rosser
% A new definition: (((eq ((fofType->(fofType->Prop))->Prop)) cr) (fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((((trsc R) X) Y)->(((join R) X) Y)))))
% Defined: cr:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((((trsc R) X) Y)->(((join R) X) Y))))
% FOF formula (((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) of role conjecture named alternative_formulation_of_terminating
% Conjecture to prove = (((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))']
% Parameter fofType:Type.
% Definition subrel:=(fun (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((S X) Y)))):((fofType->(fofType->Prop))->((fofType->(fofType->Prop))->Prop)).
% Definition inv:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((R Y) X)):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))).
% Definition idem:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), (((eq (fofType->(fofType->Prop))) (F (F R))) (F R)))):(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop).
% Definition infl:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))), ((subrel R) (F R)))):(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop).
% Definition mono:=(fun (F:((fofType->(fofType->Prop))->(fofType->(fofType->Prop))))=> (forall (R:(fofType->(fofType->Prop))) (S:(fofType->(fofType->Prop))), (((subrel R) S)->((subrel (F R)) (F S))))):(((fofType->(fofType->Prop))->(fofType->(fofType->Prop)))->Prop).
% Definition refl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((R X) X))):((fofType->(fofType->Prop))->Prop).
% Definition irrefl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), (((R X) X)->False))):((fofType->(fofType->Prop))->Prop).
% Definition rc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or (((eq fofType) X) Y)) ((R X) Y))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))).
% Definition symm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->((R Y) X)))):((fofType->(fofType->Prop))->Prop).
% Definition antisymm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((and ((R X) Y)) ((R Y) X))->(((eq fofType) X) Y)))):((fofType->(fofType->Prop))->Prop).
% Definition asymm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), (((R X) Y)->(((R Y) X)->False)))):((fofType->(fofType->Prop))->Prop).
% Definition sc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((or ((R Y) X)) ((R X) Y))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))).
% Definition trans:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Y)) ((R Y) Z))->((R X) Z)))):((fofType->(fofType->Prop))->Prop).
% Definition tc:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> (forall (S:(fofType->(fofType->Prop))), (((and (trans S)) ((subrel R) S))->((S X) Y)))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))).
% Definition trc:=(fun (R:(fofType->(fofType->Prop)))=> (rc (tc R))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))).
% Definition trsc:=(fun (R:(fofType->(fofType->Prop)))=> (sc (rc (tc R)))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))).
% Definition po:=(fun (R:(fofType->(fofType->Prop)))=> ((and ((and (refl R)) (antisymm R))) (trans R))):((fofType->(fofType->Prop))->Prop).
% Definition so:=(fun (R:(fofType->(fofType->Prop)))=> ((and (asymm R)) (trans R))):((fofType->(fofType->Prop))->Prop).
% Definition total:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((or ((or (((eq fofType) X) Y)) ((R X) Y))) ((R Y) X)))):((fofType->(fofType->Prop))->Prop).
% Definition term:=(fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False))))))))):((fofType->(fofType->Prop))->Prop).
% Definition ind:=(fun (R:(fofType->(fofType->Prop)))=> (forall (P:(fofType->Prop)), ((forall (X:fofType), ((forall (Y:fofType), ((((tc R) X) Y)->(P Y)))->(P X)))->(forall (X:fofType), (P X))))):((fofType->(fofType->Prop))->Prop).
% Definition innf:=(fun (R:(fofType->(fofType->Prop))) (X:fofType)=> (((ex fofType) (fun (Y:fofType)=> ((R X) Y)))->False)):((fofType->(fofType->Prop))->(fofType->Prop)).
% Definition nfof:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((and (((trc R) Y) X)) ((innf R) X))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))).
% Definition norm:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType), ((ex fofType) (fun (Y:fofType)=> (((nfof R) Y) X))))):((fofType->(fofType->Prop))->Prop).
% Definition join:=(fun (R:(fofType->(fofType->Prop))) (X:fofType) (Y:fofType)=> ((ex fofType) (fun (Z:fofType)=> ((and (((trc R) X) Z)) (((trc R) Y) Z))))):((fofType->(fofType->Prop))->(fofType->(fofType->Prop))).
% Definition lconfl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) ((R X) Y))->(((join R) Z) Y)))):((fofType->(fofType->Prop))->Prop).
% Definition sconfl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and ((R X) Z)) (((trc R) X) Y))->(((join R) Z) Y)))):((fofType->(fofType->Prop))->Prop).
% Definition confl:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((trc R) X) Z)) (((trc R) X) Y))->(((join R) Z) Y)))):((fofType->(fofType->Prop))->Prop).
% Definition cr:=(fun (R:(fofType->(fofType->Prop)))=> (forall (X:fofType) (Y:fofType), ((((trsc R) X) Y)->(((join R) X) Y)))):((fofType->(fofType->Prop))->Prop).
% Trying to prove (((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eta_expansion000:=(eta_expansion00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eta_expansion0 Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion_dep00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found eta_expansion000:=(eta_expansion00 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (x:(fofType->(fofType->Prop)))=> (b x)))
% Found (eta_expansion00 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found ((eta_expansion0 Prop) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) (fun (x:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (x:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found x01:(P (term x))
% Found (fun (x01:(P (term x)))=> x01) as proof of (P (term x))
% Found (fun (x01:(P (term x)))=> x01) as proof of (P0 (term x))
% Found x01:(P (term x))
% Found (fun (x01:(P (term x)))=> x01) as proof of (P (term x))
% Found (fun (x01:(P (term x)))=> x01) as proof of (P0 (term x))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found x01:(P (term x))
% Found (fun (x01:(P (term x)))=> x01) as proof of (P (term x))
% Found (fun (x01:(P (term x)))=> x01) as proof of (P0 (term x))
% Found x01:(P (term x))
% Found (fun (x01:(P (term x)))=> x01) as proof of (P (term x))
% Found (fun (x01:(P (term x)))=> x01) as proof of (P0 (term x))
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found x01:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (fun (x01:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))=> x01) as proof of (P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (fun (x01:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))=> x01) as proof of (P0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found x01:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (fun (x01:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))=> x01) as proof of (P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (fun (x01:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))=> x01) as proof of (P0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))):(((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))):(((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found eq_ref00:=(eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))):(((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))):(((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found x01:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (fun (x01:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))=> x01) as proof of (P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (fun (x01:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))=> x01) as proof of (P0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found x01:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (fun (x01:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))=> x01) as proof of (P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (fun (x01:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))=> x01) as proof of (P0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found x:(P term)
% Instantiate: b:=term:((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 b)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) (fun (x:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found x:(P term)
% Instantiate: f:=term:((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 f)
% Found x:(P term)
% Instantiate: f:=term:((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 f)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found x:(P term)
% Instantiate: b:=term:((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 b)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (x:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eta_expansion_dep000:=(eta_expansion_dep00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion_dep00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found x:(P term)
% Instantiate: f:=term:((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 f)
% Found eq_ref00:=(eq_ref0 (f x0)):(((eq Prop) (f x0)) (f x0))
% Found (eq_ref0 (f x0)) as proof of (((eq Prop) (f x0)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x0 X) Y)))))))))))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x0 X) Y)))))))))))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x0 X) Y)))))))))))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (((eq Prop) (f x0)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x0 X) Y)))))))))))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (forall (x:(fofType->(fofType->Prop))), (((eq Prop) (f x)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found x:(P term)
% Instantiate: f:=term:((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 f)
% Found eq_ref00:=(eq_ref0 (f x0)):(((eq Prop) (f x0)) (f x0))
% Found (eq_ref0 (f x0)) as proof of (((eq Prop) (f x0)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x0 X) Y)))))))))))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x0 X) Y)))))))))))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x0 X) Y)))))))))))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (((eq Prop) (f x0)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x0 X) Y)))))))))))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (forall (x:(fofType->(fofType->Prop))), (((eq Prop) (f x)) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) term)
% Found (eq_ref0 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found eta_expansion_dep000:=(eta_expansion_dep00 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (x:(fofType->(fofType->Prop)))=> (b x)))
% Found (eta_expansion_dep00 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found eta_expansion000:=(eta_expansion00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) (fun (x:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))
% Found (eta_expansion00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found ((eta_expansion0 Prop) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found x:(P0 b)
% Instantiate: b:=(fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False))))))))):((fofType->(fofType->Prop))->Prop)
% Found (fun (x:(P0 b))=> x) as proof of (P0 term)
% Found (fun (P0:(((fofType->(fofType->Prop))->Prop)->Prop)) (x:(P0 b))=> x) as proof of ((P0 b)->(P0 term))
% Found (fun (P0:(((fofType->(fofType->Prop))->Prop)->Prop)) (x:(P0 b))=> x) as proof of (P b)
% Found x:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Instantiate: b:=(fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)):((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) term)
% Found (eq_ref0 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found x3:(P term)
% Found (fun (x3:(P term))=> x3) as proof of (P term)
% Found (fun (x3:(P term))=> x3) as proof of (P0 term)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eta_expansion_dep000:=(eta_expansion_dep00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion_dep00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found eq_ref00:=(eq_ref0 b0):(((eq ((fofType->(fofType->Prop))->Prop)) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found eta_expansion_dep000:=(eta_expansion_dep00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion_dep00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found x:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Instantiate: f:=(fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)):((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 f)
% Found eq_ref00:=(eq_ref0 (f x0)):(((eq Prop) (f x0)) (f x0))
% Found (eq_ref0 (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (((eq Prop) (f x0)) (term x0))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (forall (x:(fofType->(fofType->Prop))), (((eq Prop) (f x)) (term x)))
% Found x:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Instantiate: f:=(fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)):((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 f)
% Found eq_ref00:=(eq_ref0 (f x0)):(((eq Prop) (f x0)) (f x0))
% Found (eq_ref0 (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (((eq Prop) (f x0)) (term x0))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (forall (x:(fofType->(fofType->Prop))), (((eq Prop) (f x)) (term x)))
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (x:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found x:(P0 b)
% Instantiate: b:=(fun (R:(fofType->(fofType->Prop)))=> (forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((R X) Y)->False))))))))):((fofType->(fofType->Prop))->Prop)
% Found (fun (x:(P0 b))=> x) as proof of (P0 term)
% Found (fun (P0:(((fofType->(fofType->Prop))->Prop)->Prop)) (x:(P0 b))=> x) as proof of ((P0 b)->(P0 term))
% Found (fun (P0:(((fofType->(fofType->Prop))->Prop)->Prop)) (x:(P0 b))=> x) as proof of (P b)
% Found x:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Instantiate: b:=(fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))):((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) term)
% Found (eq_ref0 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found x3:(P term)
% Found (fun (x3:(P term))=> x3) as proof of (P term)
% Found (fun (x3:(P term))=> x3) as proof of (P0 term)
% Found eta_expansion000:=(eta_expansion00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eta_expansion0 Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found eta_expansion_dep000:=(eta_expansion_dep00 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (x:(fofType->(fofType->Prop)))=> (b x)))
% Found (eta_expansion_dep00 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found x0:(P (term x))
% Instantiate: b:=(term x):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found x0:(P (term x))
% Instantiate: b:=(term x):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) (fun (x:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) (fun (x:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) (fun (x:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found x:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Instantiate: f:=(fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))):((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 f)
% Found eq_ref00:=(eq_ref0 (f x0)):(((eq Prop) (f x0)) (f x0))
% Found (eq_ref0 (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (((eq Prop) (f x0)) (term x0))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (forall (x:(fofType->(fofType->Prop))), (((eq Prop) (f x)) (term x)))
% Found x:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Instantiate: f:=(fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))):((fofType->(fofType->Prop))->Prop)
% Found x as proof of (P0 f)
% Found eq_ref00:=(eq_ref0 (f x0)):(((eq Prop) (f x0)) (f x0))
% Found (eq_ref0 (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found ((eq_ref Prop) (f x0)) as proof of (((eq Prop) (f x0)) (term x0))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (((eq Prop) (f x0)) (term x0))
% Found (fun (x0:(fofType->(fofType->Prop)))=> ((eq_ref Prop) (f x0))) as proof of (forall (x:(fofType->(fofType->Prop))), (((eq Prop) (f x)) (term x)))
% Found x0:(P (term x))
% Instantiate: b:=(term x):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))):(((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found x0:(P (term x))
% Instantiate: b:=(term x):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))):(((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (x:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (x:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (x:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P2 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P2 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P2 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P2 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found x2:(P b)
% Found (fun (x2:(P b))=> x2) as proof of (P b)
% Found (fun (x2:(P b))=> x2) as proof of (P0 b)
% Found x01:(P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P2 (term x))
% Found x01:(P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P2 (term x))
% Found x01:(P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P2 (term x))
% Found x01:(P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P2 (term x))
% Found x3:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x3:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x3) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x3:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x3) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) (fun (x:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b)
% Found eta_expansion000:=(eta_expansion00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found ((eta_expansion0 Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b0)
% Found eta_expansion_dep000:=(eta_expansion_dep00 b0):(((eq ((fofType->(fofType->Prop))->Prop)) b0) (fun (x:(fofType->(fofType->Prop)))=> (b0 x)))
% Found (eta_expansion_dep00 b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found x2:(P b)
% Found (fun (x2:(P b))=> x2) as proof of (P b)
% Found (fun (x2:(P b))=> x2) as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found x2:(P b)
% Found (fun (x2:(P b))=> x2) as proof of (P b)
% Found (fun (x2:(P b))=> x2) as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found eq_ref00:=(eq_ref0 b0):(((eq ((fofType->(fofType->Prop))->Prop)) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) (fun (x:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b0)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b0)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b0)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b0)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))) b0)
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found x0:(P0 b)
% Instantiate: b:=(forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((x X) Y)->False)))))))):Prop
% Found (fun (x0:(P0 b))=> x0) as proof of (P0 (term x))
% Found (fun (P0:(Prop->Prop)) (x0:(P0 b))=> x0) as proof of ((P0 b)->(P0 (term x)))
% Found (fun (P0:(Prop->Prop)) (x0:(P0 b))=> x0) as proof of (P b)
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found x0:(P0 b)
% Instantiate: b:=(forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((x X) Y)->False)))))))):Prop
% Found (fun (x0:(P0 b))=> x0) as proof of (P0 (term x))
% Found (fun (P0:(Prop->Prop)) (x0:(P0 b))=> x0) as proof of ((P0 b)->(P0 (term x)))
% Found (fun (P0:(Prop->Prop)) (x0:(P0 b))=> x0) as proof of (P b)
% Found x02:(P (term x))
% Found (fun (x02:(P (term x)))=> x02) as proof of (P (term x))
% Found (fun (x02:(P (term x)))=> x02) as proof of (P0 (term x))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found x02:(P (term x))
% Found (fun (x02:(P (term x)))=> x02) as proof of (P (term x))
% Found (fun (x02:(P (term x)))=> x02) as proof of (P0 (term x))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P2 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P2 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P2 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P1 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P2 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found x0:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Instantiate: b:=(((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found x0:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Instantiate: b:=(((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found x01:(P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P2 (term x))
% Found x01:(P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P2 (term x))
% Found x01:(P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P2 (term x))
% Found x01:(P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P1 (term x))
% Found (fun (x01:(P1 (term x)))=> x01) as proof of (P2 (term x))
% Found eta_expansion000:=(eta_expansion00 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (x:(fofType->(fofType->Prop)))=> (b x)))
% Found (eta_expansion00 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) b0)
% Found ((eta_expansion0 Prop) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) b0)
% Found eq_ref00:=(eq_ref0 b0):(((eq ((fofType->(fofType->Prop))->Prop)) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) term)
% Found x3:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x3:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x3) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x3:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x3) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) term)
% Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (x:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found (eta_expansion_dep00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b)
% Found x0:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Instantiate: b:=(((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found x0:(P (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Instantiate: b:=(((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b0):(((eq ((fofType->(fofType->Prop))->Prop)) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found eq_ref00:=(eq_ref0 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (eq_ref0 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eq_ref00:=(eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))):(((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found x0:(P0 b)
% Instantiate: b:=(forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((x X) Y)->False)))))))):Prop
% Found (fun (x0:(P0 b))=> x0) as proof of (P0 (term x))
% Found (fun (P0:(Prop->Prop)) (x0:(P0 b))=> x0) as proof of ((P0 b)->(P0 (term x)))
% Found (fun (P0:(Prop->Prop)) (x0:(P0 b))=> x0) as proof of (P b)
% Found eq_ref00:=(eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))):(((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found (eq_ref0 (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found ((eq_ref Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) as proof of (((eq Prop) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))) b)
% Found x0:(P0 b)
% Instantiate: b:=(forall (A:(fofType->Prop)), (((ex fofType) (fun (X:fofType)=> (A X)))->((ex fofType) (fun (X:fofType)=> ((and (A X)) (forall (Y:fofType), ((A Y)->(((x X) Y)->False)))))))):Prop
% Found (fun (x0:(P0 b))=> x0) as proof of (P0 (term x))
% Found (fun (P0:(Prop->Prop)) (x0:(P0 b))=> x0) as proof of ((P0 b)->(P0 (term x)))
% Found (fun (P0:(Prop->Prop)) (x0:(P0 b))=> x0) as proof of (P b)
% Found x02:(P (term x))
% Found (fun (x02:(P (term x)))=> x02) as proof of (P (term x))
% Found (fun (x02:(P (term x)))=> x02) as proof of (P0 (term x))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found x02:(P (term x))
% Found (fun (x02:(P (term x)))=> x02) as proof of (P (term x))
% Found (fun (x02:(P (term x)))=> x02) as proof of (P0 (term x))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Found eq_ref00:=(eq_ref0 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) b)
% Found (eq_ref0 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eta_expansion_dep000:=(eta_expansion_dep00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion_dep00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found x0:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Instantiate: b:=(not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found x0:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Instantiate: b:=(not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found eta_expansion000:=(eta_expansion00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))):(((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) (fun (x:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y))))))))))))
% Found (eta_expansion00 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found ((eta_expansion0 Prop) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found (((eta_expansion (fofType->(fofType->Prop))) Prop) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))) b0)
% Found eq_ref00:=(eq_ref0 b0):(((eq ((fofType->(fofType->Prop))->Prop)) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found ((eq_ref ((fofType->(fofType->Prop))->Prop)) b0) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b0) b)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found eq_ref00:=(eq_ref0 b0):(((eq Prop) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq Prop) b0) (b x))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (b x))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (b x))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (b x))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found eq_ref00:=(eq_ref0 b0):(((eq Prop) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq Prop) b0) (b x))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (b x))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (b x))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (b x))
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found x2:(P term)
% Found (fun (x2:(P term))=> x2) as proof of (P term)
% Found (fun (x2:(P term))=> x2) as proof of (P0 term)
% Found x0:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Instantiate: b:=(not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found x0:(P (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))))
% Instantiate: b:=(not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))):Prop
% Found x0 as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b)
% Found x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))))))=> x2) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y))))))))))))
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found x2:(P b)
% Found (fun (x2:(P b))=> x2) as proof of (P b)
% Found (fun (x2:(P b))=> x2) as proof of (P0 b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found x2:(P b)
% Found (fun (x2:(P b))=> x2) as proof of (P b)
% Found (fun (x2:(P b))=> x2) as proof of (P0 b)
% Found x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found (fun (x2:(P (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False))))=> x2) as proof of (P0 (fun (R:(fofType->(fofType->Prop)))=> (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((R X) Y)))))))))->False)))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)):(((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found (eq_ref0 (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found ((eq_ref Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) as proof of (((eq Prop) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq Prop) b) b)
% Found (eq_ref0 b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found ((eq_ref Prop) b) as proof of (((eq Prop) b) (term x))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found eq_ref00:=(eq_ref0 b0):(((eq Prop) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq Prop) b0) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eq_ref00:=(eq_ref0 (term x)):(((eq Prop) (term x)) (term x))
% Found (eq_ref0 (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found ((eq_ref Prop) (term x)) as proof of (((eq Prop) (term x)) b0)
% Found eq_ref00:=(eq_ref0 b0):(((eq Prop) b0) b0)
% Found (eq_ref0 b0) as proof of (((eq Prop) b0) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found ((eq_ref Prop) b0) as proof of (((eq Prop) b0) (((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType), ((A X)->((ex fofType) (fun (Y:fofType)=> ((and (A Y)) ((x X) Y)))))))))->False))
% Found eta_expansion_dep000:=(eta_expansion_dep00 term):(((eq ((fofType->(fofType->Prop))->Prop)) term) (fun (x:(fofType->(fofType->Prop)))=> (term x)))
% Found (eta_expansion_dep00 term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found ((eta_expansion_dep0 (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found (((eta_expansion_dep (fofType->(fofType->Prop))) (fun (x1:(fofType->(fofType->Prop)))=> Prop)) term) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) term) b)
% Found eta_expansion000:=(eta_expansion00 b):(((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (x:(fofType->(fofType->Prop)))=> (b x)))
% Found (eta_expansion00 b) as proof of (((eq ((fofType->(fofType->Prop))->Prop)) b) (fun (R:(fofType->(fofType->Prop)))=> (not ((ex (fofType->Prop)) (fun (A:(fofType->Prop))=> ((and ((ex fofType) (fun (X:fofType)=> (A X)))) (forall (X:fofType),
% EOF
%------------------------------------------------------------------------------