↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem Process solution in
SystemOnTSTP Download .tgz 
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SYO264^5 : TPTP v7.5.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 0s
% DateTime : Tue Mar 29 00:51:02 EDT 2022

% Result   : Theorem 1.07s 1.30s
% Output   : Proof 1.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SYO264^5 : TPTP v7.5.0. Released v4.0.0.
% 0.11/0.12  % Command    : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33  % Computer   : n018.cluster.edu
% 0.12/0.33  % Model      : x86_64 x86_64
% 0.12/0.33  % CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % RAMPerCPU  : 8042.1875MB
% 0.12/0.33  % OS         : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % DateTime   : Fri Mar 11 23:10:24 EST 2022
% 0.12/0.33  % CPUTime    : 
% 0.12/0.34  ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27'
% 0.12/0.34  Python 2.7.5
% 1.07/1.27  Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/']
% 1.07/1.27  FOF formula (forall (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop)), ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))))) of role conjecture named cTHM125C
% 1.07/1.27  Conjecture to prove = (forall (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop)), ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))))):Prop
% 1.07/1.27  Parameter fofType_DUMMY:fofType.
% 1.07/1.27  We need to prove ['(forall (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop)), ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))))']
% 1.07/1.27  Parameter fofType:Type.
% 1.07/1.27  Trying to prove (forall (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop)), ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))))
% 1.07/1.27  Found classic0:=(classic (x Xc)):((or (x Xc)) (not (x Xc)))
% 1.07/1.27  Found (classic (x Xc)) as proof of ((or (x Xc)) ((P Xc)->False))
% 1.07/1.27  Found (classic (x Xc)) as proof of ((or (x Xc)) ((P Xc)->False))
% 1.07/1.27  Found (classic (x Xc)) as proof of ((or (x Xc)) ((P Xc)->False))
% 1.07/1.27  Found x1:(x0 Xx)
% 1.07/1.27  Found x1 as proof of ((P Xx)->False)
% 1.07/1.27  Found (fun (x1:(x0 Xx))=> x1) as proof of ((P Xx)->False)
% 1.07/1.27  Found (fun (x1:(x0 Xx))=> x1) as proof of ((x0 Xx)->((P Xx)->False))
% 1.07/1.27  Found x1:((P Xx)->False)
% 1.07/1.27  Found (fun (x1:((P Xx)->False))=> x1) as proof of (x0 Xx)
% 1.07/1.27  Found (fun (x1:((P Xx)->False))=> x1) as proof of (((P Xx)->False)->(x0 Xx))
% 1.07/1.27  Found ((conj10 (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)) as proof of ((and ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx)))
% 1.07/1.27  Found (((conj1 (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)) as proof of ((and ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx)))
% 1.07/1.27  Found ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)) as proof of ((and ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx)))
% 1.07/1.27  Found ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)) as proof of ((and ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx)))
% 1.07/1.27  Found (fun (Xx:fofType)=> ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))) as proof of ((iff (x0 Xx)) ((P Xx)->False))
% 1.07/1.27  Found (fun (Xx:fofType)=> ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))) as proof of (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False)))
% 1.07/1.27  Found classic0:=(classic (x Xc)):((or (x Xc)) (not (x Xc)))
% 1.07/1.27  Found (classic (x Xc)) as proof of ((or (x Xc)) ((P Xc)->False))
% 1.07/1.27  Found (classic (x Xc)) as proof of ((or (x Xc)) ((P Xc)->False))
% 1.07/1.27  Found (classic (x Xc)) as proof of ((or (x Xc)) ((P Xc)->False))
% 1.07/1.27  Found classic0:=(classic (P Xb)):((or (P Xb)) (not (P Xb)))
% 1.07/1.27  Found (classic (P Xb)) as proof of ((or (P Xb)) (x0 Xb))
% 1.07/1.27  Found (classic (P Xb)) as proof of ((or (P Xb)) (x0 Xb))
% 1.07/1.27  Found classic0:=(classic (x Xa)):((or (x Xa)) (not (x Xa)))
% 1.07/1.27  Found (classic (x Xa)) as proof of ((or (x Xa)) (x0 Xa))
% 1.07/1.27  Found (classic (x Xa)) as proof of ((or (x Xa)) (x0 Xa))
% 1.07/1.27  Found (classic (x Xa)) as proof of ((or (x Xa)) (x0 Xa))
% 1.07/1.27  Found ((conj20 (classic (x Xa))) (classic (P Xb))) as proof of ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))
% 1.07/1.28  Found (((conj2 ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb))) as proof of ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))
% 1.07/1.28  Found ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb))) as proof of ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))
% 1.07/1.28  Found ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb))) as proof of ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))
% 1.07/1.28  Found ((conj10 ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc))) as proof of ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))
% 1.07/1.28  Found (((conj1 ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc))) as proof of ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))
% 1.07/1.28  Found ((((conj ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc))) as proof of ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))
% 1.07/1.28  Found ((((conj ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc))) as proof of ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))
% 1.07/1.28  Found ((conj00 ((((conj ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))) as proof of ((and ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False))))
% 1.07/1.28  Found (((conj0 (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False)))) ((((conj ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))) as proof of ((and ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False))))
% 1.07/1.28  Found ((((conj ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False)))) ((((conj ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))) as proof of ((and ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False))))
% 1.07/1.28  Found ((((conj ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False)))) ((((conj ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))) as proof of ((and ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False))))
% 1.07/1.28  Found (ex_intro010 ((((conj ((and ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (x0 Xx)) ((P Xx)->False)))) ((((conj ((and ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) (x0 Xa))) ((or (P Xb)) (x0 Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj ((x0 Xx)->((P Xx)->False))) (((P Xx)->False)->(x0 Xx))) (fun (x1:(x0 Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))) as proof of ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (x Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))
% 1.07/1.28  Found ((ex_intro01 (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))) as proof of ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (x Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))
% 1.07/1.28  Found (((ex_intro0 (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (x Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))) as proof of ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (x Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))
% 1.07/1.28  Found (((ex_intro0 (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (x Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))) as proof of ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (x Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))
% 1.07/1.28  Found (ex_intro000 (((ex_intro0 (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (x Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (x Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (x Xc)) ((P Xc)->False))) ((((conj ((or (x Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (x Xa))) (classic (P Xb)))) (classic (x Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))))) as proof of ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))))
% 1.07/1.28  Found ((ex_intro00 P) (((ex_intro0 (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))))) as proof of ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))))
% 1.07/1.28  Found (((ex_intro0 (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) (((ex_intro0 (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))))) as proof of ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))))
% 1.07/1.29  Found ((((ex_intro (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) ((((ex_intro (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))))) as proof of ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))))
% 1.07/1.29  Found (fun (P:(fofType->Prop))=> ((((ex_intro (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) ((((ex_intro (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))))) as proof of ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False))))))))
% 1.07/1.29  Found (fun (Xc:fofType) (P:(fofType->Prop))=> ((((ex_intro (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) ((((ex_intro (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))))) as proof of (forall (P:(fofType->Prop)), ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))))
% 1.07/1.29  Found (fun (Xb:fofType) (Xc:fofType) (P:(fofType->Prop))=> ((((ex_intro (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) ((((ex_intro (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))))) as proof of (forall (Xc:fofType) (P:(fofType->Prop)), ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))))
% 1.07/1.29  Found (fun (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop))=> ((((ex_intro (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) ((((ex_intro (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))))) as proof of (forall (Xb:fofType) (Xc:fofType) (P:(fofType->Prop)), ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))))
% 1.07/1.29  Found (fun (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop))=> ((((ex_intro (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) ((((ex_intro (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1))))))) as proof of (forall (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop)), ((ex (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))))
% 1.07/1.29  Got proof (fun (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop))=> ((((ex_intro (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) ((((ex_intro (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))))))
% 1.07/1.30  Time elapsed = 0.692938s
% 1.07/1.30  node=201 cost=1448.000000 depth=27
% 1.07/1.30  ::::::::::::::::::::::
% 1.07/1.30  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.07/1.30  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.07/1.30  (fun (Xa:fofType) (Xb:fofType) (Xc:fofType) (P:(fofType->Prop))=> ((((ex_intro (fofType->Prop)) (fun (Xm:(fofType->Prop))=> ((ex (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (Xm Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (Xm Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))))) P) ((((ex_intro (fofType->Prop)) (fun (Xn:(fofType->Prop))=> ((and ((and ((and ((or (P Xa)) (Xn Xa))) ((or (P Xb)) (Xn Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff (Xn Xx)) ((P Xx)->False)))))) (fun (a0:fofType)=> ((P a0)->False))) ((((conj ((and ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False)))) (forall (Xx:fofType), ((iff ((fun (a0:fofType)=> ((P a0)->False)) Xx)) ((P Xx)->False)))) ((((conj ((and ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb)))) ((or (P Xc)) ((P Xc)->False))) ((((conj ((or (P Xa)) ((fun (a0:fofType)=> ((P a0)->False)) Xa))) ((or (P Xb)) ((fun (a0:fofType)=> ((P a0)->False)) Xb))) (classic (P Xa))) (classic (P Xb)))) (classic (P Xc)))) (fun (Xx:fofType)=> ((((conj (((fun (a0:fofType)=> ((P a0)->False)) Xx)->((P Xx)->False))) (((P Xx)->False)->((fun (a0:fofType)=> ((P a0)->False)) Xx))) (fun (x1:((fun (a0:fofType)=> ((P a0)->False)) Xx))=> x1)) (fun (x1:((P Xx)->False))=> x1)))))))
% 1.07/1.30  % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
%------------------------------------------------------------------------------