%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEV285^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 : n091.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:59 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  : SEV285^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n091.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 08:44:01 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 0x1ed59e0>, <kernel.Type object at 0x1ed60e0>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula (<kernel.Constant object at 0x1ed54d0>, <kernel.Type object at 0x1ed60e0>) of role type named b_type
% Using role type
% Declaring b:Type
% FOF formula (forall (F:(a->b)) (G:(a->b)), ((forall (A:a), (((eq b) (F A)) (G A)))->(((eq (a->b)) F) G))) of role conjecture named cEE_eq_
% Conjecture to prove = (forall (F:(a->b)) (G:(a->b)), ((forall (A:a), (((eq b) (F A)) (G A)))->(((eq (a->b)) F) G))):Prop
% Parameter a_DUMMY:a.
% Parameter b_DUMMY:b.
% We need to prove ['(forall (F:(a->b)) (G:(a->b)), ((forall (A:a), (((eq b) (F A)) (G A)))->(((eq (a->b)) F) G)))']
% Parameter a:Type.
% Parameter b:Type.
% Trying to prove (forall (F:(a->b)) (G:(a->b)), ((forall (A:a), (((eq b) (F A)) (G A)))->(((eq (a->b)) F) G)))
% Found functional_extensionality_dep00:=(functional_extensionality_dep0 (fun (x1:a)=> b)):(forall (f:(a->b)) (g:(a->b)), ((forall (x:a), (((eq b) (f x)) (g x)))->(((eq (a->b)) f) g)))
% Found (functional_extensionality_dep0 (fun (x1:a)=> b)) as proof of (forall (F:(a->b)) (G:(a->b)), ((forall (A:a), (((eq b) (F A)) (G A)))->(((eq (a->b)) F) G)))
% Found ((functional_extensionality_dep a) (fun (x1:a)=> b)) as proof of (forall (F:(a->b)) (G:(a->b)), ((forall (A:a), (((eq b) (F A)) (G A)))->(((eq (a->b)) F) G)))
% Found ((functional_extensionality_dep a) (fun (x1:a)=> b)) as proof of (forall (F:(a->b)) (G:(a->b)), ((forall (A:a), (((eq b) (F A)) (G A)))->(((eq (a->b)) F) G)))
% Got proof ((functional_extensionality_dep a) (fun (x1:a)=> b))
% Time elapsed = 0.078810s
% node=4 cost=-193.000000 depth=2
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% ((functional_extensionality_dep a) (fun (x1:a)=> b))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------