%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : LCL726^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 : n187.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:26:10 EDT 2014

% Result   : Timeout 300.07s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : LCL726^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n187.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 10:43:46 CDT 2014
% % CPUTime  : 300.07 
% 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 0x1bb0c20>, <kernel.Type object at 0x1bb0488>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula ((forall (Xs:((a->Prop)->Prop)), ((forall (X:(a->Prop)), ((Xs X)->((ex a) (fun (Xt:a)=> (X Xt)))))->((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> (forall (X:(a->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xg:(((a->Prop)->a)->(a->Prop))), ((forall (Xh:((a->Prop)->a)), ((ex a) (fun (Xu:a)=> ((Xg Xh) Xu))))->((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf)))))))) of role conjecture named cTHM534
% Conjecture to prove = ((forall (Xs:((a->Prop)->Prop)), ((forall (X:(a->Prop)), ((Xs X)->((ex a) (fun (Xt:a)=> (X Xt)))))->((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> (forall (X:(a->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xg:(((a->Prop)->a)->(a->Prop))), ((forall (Xh:((a->Prop)->a)), ((ex a) (fun (Xu:a)=> ((Xg Xh) Xu))))->((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf)))))))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['((forall (Xs:((a->Prop)->Prop)), ((forall (X:(a->Prop)), ((Xs X)->((ex a) (fun (Xt:a)=> (X Xt)))))->((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> (forall (X:(a->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xg:(((a->Prop)->a)->(a->Prop))), ((forall (Xh:((a->Prop)->a)), ((ex a) (fun (Xu:a)=> ((Xg Xh) Xu))))->((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf))))))))']
% Parameter a:Type.
% Trying to prove ((forall (Xs:((a->Prop)->Prop)), ((forall (X:(a->Prop)), ((Xs X)->((ex a) (fun (Xt:a)=> (X Xt)))))->((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> (forall (X:(a->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xg:(((a->Prop)->a)->(a->Prop))), ((forall (Xh:((a->Prop)->a)), ((ex a) (fun (Xu:a)=> ((Xg Xh) Xu))))->((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf))))))))
% Found x2:((Xg Xh) x1)
% Instantiate: x3:=Xh:((a->Prop)->a);Xh:=(fun (x4:(a->Prop))=> x1):((a->Prop)->a)
% Found x2 as proof of ((Xg x3) (x3 (Xg x3)))
% Found (ex_intro000 x2) as proof of ((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf)))))
% Found ((ex_intro00 Xh) x2) as proof of ((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf)))))
% Found (((ex_intro0 (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf))))) Xh) x2) as proof of ((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf)))))
% Found ((((ex_intro ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf))))) Xh) x2) as proof of ((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf)))))
% Found (fun (x2:((Xg Xh) x1))=> ((((ex_intro ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf))))) Xh) x2)) as proof of ((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf)))))
% Found x13:((Xg Xh4) x12)
% Instantiate: x11:=Xh4:((a->Prop)->a);Xh4:=(fun (x14:(a->Prop))=> x12):((a->Prop)->a)
% Found (fun (x13:((Xg Xh4) x12))=> x13) as proof of ((Xg x11) (x11 (Xg x11)))
% Found x13:((Xg Xh4) x12)
% Instantiate: x9:=Xh4:((a->Prop)->a);Xh4:=(fun (x14:(a->Prop))=> x12):((a->Prop)->a)
% Found (fun (x13:((Xg Xh4) x12))=> x13) as proof of ((Xg x9) (x9 (Xg x9)))
% Found x13:((Xg Xh4) x12)
% Instantiate: x7:=Xh4:((a->Prop)->a);Xh4:=(fun (x14:(a->Prop))=> x12):((a->Prop)->a)
% Found (fun (x13:((Xg Xh4) x12))=> x13) as proof of ((Xg x7) (x7 (Xg x7)))
% Found x13:((Xg Xh4) x12)
% Instantiate: x1:=Xh4:((a->Prop)->a);Xh4:=(fun (x14:(a->Prop))=> x12):((a->Prop)->a)
% Found (fun (x13:((Xg Xh4) x12))=> x13) as proof of ((Xg x1) (x1 (Xg x1)))
% Found x12:((Xg Xh4) x11)
% Instantiate: x13:=Xh4:((a->Prop)->a);Xh4:=(fun (x14:(a->Prop))=> x11):((a->Prop)->a)
% Found x12 as proof of ((Xg x13) (x13 (Xg x13)))
% Found x12 as proof of ((Xg x13) (x13 (Xg x13)))
% Found x12:((Xg Xh4) x11)
% Instantiate: x15:=Xh4:((a->Prop)->a);Xh4:=(fun (x16:(a->Prop))=> x11):((a->Prop)->a)
% Found x12 as proof of ((Xg x15) (x15 (Xg x15)))
% Found (ex_intro000 x12) as proof of ((ex ((a->Prop)->a)) (fun (Xf:((a->Prop)->a))=> ((Xg Xf) (Xf (Xg Xf)))))
% Found ((e
% EOF
%------------------------------------------------------------------------------