%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU834^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 : n111.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:33:15 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU834^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n111.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 11:36:01 CDT 2014
% % CPUTime  : 0.37 
% 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 0x1164128>, <kernel.Type object at 0x1164290>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula (forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), (((and (S Xx)) (T Xx))->(T Xx))) of role conjecture named cGAZING_THM21_pme
% Conjecture to prove = (forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), (((and (S Xx)) (T Xx))->(T Xx))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['(forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), (((and (S Xx)) (T Xx))->(T Xx)))']
% Parameter a:Type.
% Trying to prove (forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), (((and (S Xx)) (T Xx))->(T Xx)))
% Found x1:(T Xx)
% Found (fun (x1:(T Xx))=> x1) as proof of (T Xx)
% Found (fun (x0:(S Xx)) (x1:(T Xx))=> x1) as proof of ((T Xx)->(T Xx))
% Found (fun (x0:(S Xx)) (x1:(T Xx))=> x1) as proof of ((S Xx)->((T Xx)->(T Xx)))
% Found (and_rect00 (fun (x0:(S Xx)) (x1:(T Xx))=> x1)) as proof of (T Xx)
% Found ((and_rect0 (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1)) as proof of (T Xx)
% Found (((fun (P:Type) (x0:((S Xx)->((T Xx)->P)))=> (((((and_rect (S Xx)) (T Xx)) P) x0) x)) (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1)) as proof of (T Xx)
% Found (fun (x:((and (S Xx)) (T Xx)))=> (((fun (P:Type) (x0:((S Xx)->((T Xx)->P)))=> (((((and_rect (S Xx)) (T Xx)) P) x0) x)) (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1))) as proof of (T Xx)
% Found (fun (Xx:a) (x:((and (S Xx)) (T Xx)))=> (((fun (P:Type) (x0:((S Xx)->((T Xx)->P)))=> (((((and_rect (S Xx)) (T Xx)) P) x0) x)) (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1))) as proof of (((and (S Xx)) (T Xx))->(T Xx))
% Found (fun (T:(a->Prop)) (Xx:a) (x:((and (S Xx)) (T Xx)))=> (((fun (P:Type) (x0:((S Xx)->((T Xx)->P)))=> (((((and_rect (S Xx)) (T Xx)) P) x0) x)) (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1))) as proof of (forall (Xx:a), (((and (S Xx)) (T Xx))->(T Xx)))
% Found (fun (S:(a->Prop)) (T:(a->Prop)) (Xx:a) (x:((and (S Xx)) (T Xx)))=> (((fun (P:Type) (x0:((S Xx)->((T Xx)->P)))=> (((((and_rect (S Xx)) (T Xx)) P) x0) x)) (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1))) as proof of (forall (T:(a->Prop)) (Xx:a), (((and (S Xx)) (T Xx))->(T Xx)))
% Found (fun (S:(a->Prop)) (T:(a->Prop)) (Xx:a) (x:((and (S Xx)) (T Xx)))=> (((fun (P:Type) (x0:((S Xx)->((T Xx)->P)))=> (((((and_rect (S Xx)) (T Xx)) P) x0) x)) (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1))) as proof of (forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), (((and (S Xx)) (T Xx))->(T Xx)))
% Got proof (fun (S:(a->Prop)) (T:(a->Prop)) (Xx:a) (x:((and (S Xx)) (T Xx)))=> (((fun (P:Type) (x0:((S Xx)->((T Xx)->P)))=> (((((and_rect (S Xx)) (T Xx)) P) x0) x)) (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1)))
% Time elapsed = 0.057858s
% node=10 cost=89.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 (S:(a->Prop)) (T:(a->Prop)) (Xx:a) (x:((and (S Xx)) (T Xx)))=> (((fun (P:Type) (x0:((S Xx)->((T Xx)->P)))=> (((((and_rect (S Xx)) (T Xx)) P) x0) x)) (T Xx)) (fun (x0:(S Xx)) (x1:(T Xx))=> x1)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------