%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : LCL729^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 : n190.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:11 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : LCL729^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n190.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:44:06 CDT 2014
% % CPUTime  : 300.10 
% 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 0xd08950>, <kernel.Type object at 0xd08f38>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula ((iff (forall (Xr:((a->Prop)->(a->Prop))), ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))) (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))))))))) of role conjecture named cTHM560
% Conjecture to prove = ((iff (forall (Xr:((a->Prop)->(a->Prop))), ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))) (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))))))))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['((iff (forall (Xr:((a->Prop)->(a->Prop))), ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))) (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)))))))))']
% Parameter a:Type.
% Trying to prove ((iff (forall (Xr:((a->Prop)->(a->Prop))), ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))) (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)))))))))
% Found a_DUMMY:a
% Found a_DUMMY as proof of a
% Found (classical_choice000 a_DUMMY) as proof of ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx))))))
% Found ((classical_choice00 Xr) a_DUMMY) as proof of ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx))))))
% Found (((classical_choice0 a) Xr) a_DUMMY) as proof of ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx))))))
% Found ((((classical_choice (a->Prop)) a) Xr) a_DUMMY) as proof of ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx))))))
% Found (fun (Xr:((a->Prop)->(a->Prop)))=> ((((classical_choice (a->Prop)) a) Xr) a_DUMMY)) as proof of ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx))))))
% Found (fun (x:(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))))))))) (Xr:((a->Prop)->(a->Prop)))=> ((((classical_choice (a->Prop)) a) Xr) a_DUMMY)) as proof of (forall (Xr:((a->Prop)->(a->Prop))), ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))
% Found (fun (x:(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))))))))) (Xr:((a->Prop)->(a->Prop)))=> ((((classical_choice (a->Prop)) a) Xr) a_DUMMY)) as proof of ((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 (Xr:((a->Prop)->(a->Prop))), ((ex ((a->Prop)->a)) (fun (Xg:((a->Prop)->a))=> (forall (Xx:(a->Prop)), (((ex a) (fun (Xy:a)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx))))))))
% EOF
%------------------------------------------------------------------------------