%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SET185^5 : TPTP v6.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n106.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:30:20 EDT 2014

% Result   : Theorem 0.39s
% Output   : Proof 0.39s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SET185^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n106.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 09:20:36 CDT 2014
% % CPUTime  : 0.39 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x299cc20>, <kernel.Type object at 0x299c3b0>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula (forall (X:(a->Prop)) (Y:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Y Xx))->(Y Xx))))) of role conjecture named cBOOL_PROP_35_pme
% Conjecture to prove = (forall (X:(a->Prop)) (Y:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Y Xx))->(Y Xx))))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['(forall (X:(a->Prop)) (Y:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Y Xx))->(Y Xx)))))']
% Parameter a:Type.
% Trying to prove (forall (X:(a->Prop)) (Y:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Y Xx))->(Y Xx)))))
% Found x1:=(x Xx):((X Xx)->(Y Xx))
% Found (x Xx) as proof of ((X Xx)->(Y Xx))
% Found (x Xx) as proof of ((X Xx)->(Y Xx))
% Found x1:(Y Xx)
% Found (fun (x1:(Y Xx))=> x1) as proof of (Y Xx)
% Found (fun (x1:(Y Xx))=> x1) as proof of ((Y Xx)->(Y Xx))
% Found ((or_ind00 (x Xx)) (fun (x1:(Y Xx))=> x1)) as proof of (Y Xx)
% Found (((or_ind0 (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1)) as proof of (Y Xx)
% Found ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1)) as proof of (Y Xx)
% Found (fun (x0:((or (X Xx)) (Y Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1))) as proof of (Y Xx)
% Found (fun (Xx:a) (x0:((or (X Xx)) (Y Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1))) as proof of (((or (X Xx)) (Y Xx))->(Y Xx))
% Found (fun (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Y Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1))) as proof of (forall (Xx:a), (((or (X Xx)) (Y Xx))->(Y Xx)))
% Found (fun (Y:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Y Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1))) as proof of ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Y Xx))->(Y Xx))))
% Found (fun (X:(a->Prop)) (Y:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Y Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1))) as proof of (forall (Y:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Y Xx))->(Y Xx)))))
% Found (fun (X:(a->Prop)) (Y:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Y Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1))) as proof of (forall (X:(a->Prop)) (Y:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Y Xx))->(Y Xx)))))
% Got proof (fun (X:(a->Prop)) (Y:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Y Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1)))
% Time elapsed = 0.085417s
% node=17 cost=90.000000 depth=10
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (X:(a->Prop)) (Y:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Y Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Y Xx)->P))=> ((((((or_ind (X Xx)) (Y Xx)) P) x1) x2) x0)) (Y Xx)) (x Xx)) (fun (x1:(Y Xx))=> x1)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------