cocATP---0.2.0.THM-Prf.s

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU841^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 : n116.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:16 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU841^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n116.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:06 CDT 2014
% % CPUTime  : 0.65 
% 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 0x1b5b908>, <kernel.Type object at 0x1b5b8c0>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula (forall (S:(a->Prop)) (T:(a->Prop)) (U:(a->Prop)), (((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U))->(((eq (a->Prop)) S) U))) of role conjecture named cGAZING_THM7
% Conjecture to prove = (forall (S:(a->Prop)) (T:(a->Prop)) (U:(a->Prop)), (((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U))->(((eq (a->Prop)) S) U))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['(forall (S:(a->Prop)) (T:(a->Prop)) (U:(a->Prop)), (((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U))->(((eq (a->Prop)) S) U)))']
% Parameter a:Type.
% Trying to prove (forall (S:(a->Prop)) (T:(a->Prop)) (U:(a->Prop)), (((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U))->(((eq (a->Prop)) S) U)))
% Found eq_trans0000:=(eq_trans000 U):((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->(((eq (a->Prop)) S) U)))
% Found (eq_trans000 U) as proof of ((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->(((eq (a->Prop)) S) U)))
% Found ((eq_trans00 T) U) as proof of ((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->(((eq (a->Prop)) S) U)))
% Found (((eq_trans0 S) T) U) as proof of ((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->(((eq (a->Prop)) S) U)))
% Found ((((eq_trans (a->Prop)) S) T) U) as proof of ((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->(((eq (a->Prop)) S) U)))
% Found ((((eq_trans (a->Prop)) S) T) U) as proof of ((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->(((eq (a->Prop)) S) U)))
% Found (and_rect00 ((((eq_trans (a->Prop)) S) T) U)) as proof of (((eq (a->Prop)) S) U)
% Found ((and_rect0 (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U)) as proof of (((eq (a->Prop)) S) U)
% Found (((fun (P:Type) (x0:((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->P)))=> (((((and_rect (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)) P) x0) x)) (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U)) as proof of (((eq (a->Prop)) S) U)
% Found (fun (x:((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)))=> (((fun (P:Type) (x0:((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->P)))=> (((((and_rect (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)) P) x0) x)) (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U))) as proof of (((eq (a->Prop)) S) U)
% Found (fun (U:(a->Prop)) (x:((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)))=> (((fun (P:Type) (x0:((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->P)))=> (((((and_rect (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)) P) x0) x)) (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U))) as proof of (((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U))->(((eq (a->Prop)) S) U))
% Found (fun (T:(a->Prop)) (U:(a->Prop)) (x:((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)))=> (((fun (P:Type) (x0:((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->P)))=> (((((and_rect (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)) P) x0) x)) (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U))) as proof of (forall (U:(a->Prop)), (((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U))->(((eq (a->Prop)) S) U)))
% Found (fun (S:(a->Prop)) (T:(a->Prop)) (U:(a->Prop)) (x:((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)))=> (((fun (P:Type) (x0:((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->P)))=> (((((and_rect (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)) P) x0) x)) (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U))) as proof of (forall (T:(a->Prop)) (U:(a->Prop)), (((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U))->(((eq (a->Prop)) S) U)))
% Found (fun (S:(a->Prop)) (T:(a->Prop)) (U:(a->Prop)) (x:((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)))=> (((fun (P:Type) (x0:((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->P)))=> (((((and_rect (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)) P) x0) x)) (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U))) as proof of (forall (S:(a->Prop)) (T:(a->Prop)) (U:(a->Prop)), (((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U))->(((eq (a->Prop)) S) U)))
% Got proof (fun (S:(a->Prop)) (T:(a->Prop)) (U:(a->Prop)) (x:((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)))=> (((fun (P:Type) (x0:((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->P)))=> (((((and_rect (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)) P) x0) x)) (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U)))
% Time elapsed = 0.341674s
% node=30 cost=-279.000000 depth=12
% ::::::::::::::::::::::
% % 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)) (U:(a->Prop)) (x:((and (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)))=> (((fun (P:Type) (x0:((((eq (a->Prop)) S) T)->((((eq (a->Prop)) T) U)->P)))=> (((((and_rect (((eq (a->Prop)) S) T)) (((eq (a->Prop)) T) U)) P) x0) x)) (((eq (a->Prop)) S) U)) ((((eq_trans (a->Prop)) S) T) U)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------