%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEV430^1 : TPTP v6.1.0. Released v5.2.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:34:11 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEV430^1 : TPTP v6.1.0. Released v5.2.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 09:13:01 CDT 2014
% % CPUTime  : 0.46 
% 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 0x28bc9e0>, <kernel.DependentProduct object at 0x2b13950>) of role type named f
% Using role type
% Declaring f:(fofType->fofType)
% FOF formula (forall (Y:fofType), ((ex fofType) (fun (X:fofType)=> (((eq fofType) (f X)) Y)))) of role axiom named fsurj
% A new axiom: (forall (Y:fofType), ((ex fofType) (fun (X:fofType)=> (((eq fofType) (f X)) Y))))
% FOF formula ((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X)))) of role conjecture named invexists
% Conjecture to prove = ((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X)))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X))))']
% Parameter fofType:Type.
% Parameter f:(fofType->fofType).
% Axiom fsurj:(forall (Y:fofType), ((ex fofType) (fun (X:fofType)=> (((eq fofType) (f X)) Y)))).
% Trying to prove ((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X))))
% Found fsurj:(forall (Y:fofType), ((ex fofType) (fun (X:fofType)=> (((eq fofType) (f X)) Y))))
% Found fsurj as proof of (forall (x:fofType), ((ex fofType) (fun (y:fofType)=> (((eq fofType) (f y)) x))))
% Found (choice000 fsurj) as proof of ((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X))))
% Found ((choice00 (fun (x3:fofType) (x20:fofType)=> (((eq fofType) (f x20)) x3))) fsurj) as proof of ((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X))))
% Found (((choice0 fofType) (fun (x3:fofType) (x20:fofType)=> (((eq fofType) (f x20)) x3))) fsurj) as proof of ((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X))))
% Found ((((choice fofType) fofType) (fun (x3:fofType) (x20:fofType)=> (((eq fofType) (f x20)) x3))) fsurj) as proof of ((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X))))
% Found ((((choice fofType) fofType) (fun (x3:fofType) (x20:fofType)=> (((eq fofType) (f x20)) x3))) fsurj) as proof of ((ex (fofType->fofType)) (fun (G:(fofType->fofType))=> (forall (X:fofType), (((eq fofType) (f (G X))) X))))
% Got proof ((((choice fofType) fofType) (fun (x3:fofType) (x20:fofType)=> (((eq fofType) (f x20)) x3))) fsurj)
% Time elapsed = 0.140981s
% node=31 cost=129.000000 depth=5
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% ((((choice fofType) fofType) (fun (x3:fofType) (x20:fofType)=> (((eq fofType) (f x20)) x3))) fsurj)
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------