cocATP---0.2.0.THM-Prf.s

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SET043^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 : n115.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:30:02 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SET043^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n115.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:15:26 CDT 2014
% % CPUTime  : 0.81 
% 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 0x9fc908>, <kernel.DependentProduct object at 0x9fce18>) of role type named cE
% Using role type
% Declaring cE:(fofType->(fofType->Prop))
% FOF formula (((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False)))))->False) of role conjecture named cRUSSELL1
% Conjecture to prove = (((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False)))))->False):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False)))))->False)']
% Parameter fofType:Type.
% Parameter cE:(fofType->(fofType->Prop)).
% Trying to prove (((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False)))))->False)
% Found x200:=(x20 x00):False
% Found (x20 x00) as proof of False
% Found ((x2 x00) x00) as proof of False
% Found (fun (x00:((cE V) V))=> ((x2 x00) x00)) as proof of False
% Found (fun (x00:((cE V) V))=> ((x2 x00) x00)) as proof of (((cE V) V)->False)
% Found (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00))) as proof of ((cE V) V)
% Found (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00))) as proof of ((cE V) V)
% Found (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00))) as proof of ((cE V) V)
% Found x200:=(x20 x00):False
% Found (x20 x00) as proof of False
% Found ((x2 x00) x00) as proof of False
% Found (fun (x00:((cE V) V))=> ((x2 x00) x00)) as proof of False
% Found (fun (x00:((cE V) V))=> ((x2 x00) x00)) as proof of (((cE V) V)->False)
% Found (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00))) as proof of ((cE V) x0)
% Found (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00))) as proof of ((cE V) x0)
% Found ((x2 (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))) as proof of False
% Found (fun (x3:((((cE V) V)->False)->((cE V) x0)))=> ((x2 (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00))))) as proof of False
% Found (fun (x2:(((cE V) x0)->(((cE V) V)->False))) (x3:((((cE V) V)->False)->((cE V) x0)))=> ((x2 (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00))))) as proof of (((((cE V) V)->False)->((cE V) x0))->False)
% Found (fun (x2:(((cE V) x0)->(((cE V) V)->False))) (x3:((((cE V) V)->False)->((cE V) x0)))=> ((x2 (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00))))) as proof of ((((cE V) x0)->(((cE V) V)->False))->(((((cE V) V)->False)->((cE V) x0))->False))
% Found (and_rect00 (fun (x2:(((cE V) x0)->(((cE V) V)->False))) (x3:((((cE V) V)->False)->((cE V) x0)))=> ((x2 (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))))) as proof of False
% Found ((and_rect0 False) (fun (x2:(((cE V) x0)->(((cE V) V)->False))) (x3:((((cE V) V)->False)->((cE V) x0)))=> ((x2 (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))))) as proof of False
% Found (((fun (P:Type) (x2:((((cE V) x0)->(((cE V) V)->False))->(((((cE V) V)->False)->((cE V) x0))->P)))=> (((((and_rect (((cE V) x0)->(((cE V) V)->False))) ((((cE V) V)->False)->((cE V) x0))) P) x2) x10)) False) (fun (x2:(((cE V) x0)->(((cE V) V)->False))) (x3:((((cE V) V)->False)->((cE V) x0)))=> ((x2 (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE V) V))=> ((x2 x00) x00)))))) as proof of False
% Found (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))))) as proof of False
% Found (fun (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00))))))) as proof of False
% Found (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00))))))) as proof of ((forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False)))->False)
% Found (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00))))))) as proof of (forall (x:fofType), ((forall (V:fofType), ((iff ((cE V) x)) (((cE V) V)->False)))->False))
% Found (ex_ind00 (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))))))) as proof of False
% Found ((ex_ind0 False) (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))))))) as proof of False
% Found (((fun (P:Prop) (x0:(forall (x:fofType), ((forall (V:fofType), ((iff ((cE V) x)) (((cE V) V)->False)))->P)))=> (((((ex_ind fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))) P) x0) x)) False) (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))))))) as proof of False
% Found (fun (x:((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))))=> (((fun (P:Prop) (x0:(forall (x:fofType), ((forall (V:fofType), ((iff ((cE V) x)) (((cE V) V)->False)))->P)))=> (((((ex_ind fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))) P) x0) x)) False) (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00))))))))) as proof of False
% Found (fun (x:((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))))=> (((fun (P:Prop) (x0:(forall (x:fofType), ((forall (V:fofType), ((iff ((cE V) x)) (((cE V) V)->False)))->P)))=> (((((ex_ind fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))) P) x0) x)) False) (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00))))))))) as proof of (((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False)))))->False)
% Got proof (fun (x:((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))))=> (((fun (P:Prop) (x0:(forall (x:fofType), ((forall (V:fofType), ((iff ((cE V) x)) (((cE V) V)->False)))->P)))=> (((((ex_ind fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))) P) x0) x)) False) (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))))))))
% Time elapsed = 0.487049s
% node=85 cost=529.000000 depth=21
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:((ex fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))))=> (((fun (P:Prop) (x0:(forall (x:fofType), ((forall (V:fofType), ((iff ((cE V) x)) (((cE V) V)->False)))->P)))=> (((((ex_ind fofType) (fun (U:fofType)=> (forall (V:fofType), ((iff ((cE V) U)) (((cE V) V)->False))))) P) x0) x)) False) (fun (x0:fofType) (x1:(forall (V:fofType), ((iff ((cE V) x0)) (((cE V) V)->False))))=> (((fun (P:Type) (x2:((((cE x0) x0)->(((cE x0) x0)->False))->(((((cE x0) x0)->False)->((cE x0) x0))->P)))=> (((((and_rect (((cE x0) x0)->(((cE x0) x0)->False))) ((((cE x0) x0)->False)->((cE x0) x0))) P) x2) (x1 x0))) False) (fun (x2:(((cE x0) x0)->(((cE x0) x0)->False))) (x3:((((cE x0) x0)->False)->((cE x0) x0)))=> ((x2 (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))) (x3 (fun (x00:((cE x0) x0))=> ((x2 x00) x00)))))))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------