TSTP Solution File: SEU580^2 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU580^2 : TPTP v6.1.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n103.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:32:31 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU580^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n103.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:47:41 CDT 2014
% % CPUTime  : 0.40 
% 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 0x2710758>, <kernel.DependentProduct object at 0x2710bd8>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x2acd170>, <kernel.DependentProduct object at 0x27105f0>) of role type named powerset_type
% Using role type
% Declaring powerset:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x2710e18>, <kernel.DependentProduct object at 0x2710488>) of role type named dsetconstr_type
% Using role type
% Declaring dsetconstr:(fofType->((fofType->Prop)->fofType))
% FOF formula (<kernel.Constant object at 0x27107a0>, <kernel.Sort object at 0x25d5cf8>) of role type named dsetconstrEL_type
% Using role type
% Declaring dsetconstrEL:Prop
% FOF formula (((eq Prop) dsetconstrEL) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A)))) of role definition named dsetconstrEL
% A new definition: (((eq Prop) dsetconstrEL) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A))))
% Defined: dsetconstrEL:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A)))
% FOF formula (<kernel.Constant object at 0x2710368>, <kernel.Sort object at 0x25d5cf8>) of role type named powersetI_type
% Using role type
% Declaring powersetI:Prop
% FOF formula (((eq Prop) powersetI) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A))))) of role definition named powersetI
% A new definition: (((eq Prop) powersetI) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))))
% Defined: powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A))))
% FOF formula (dsetconstrEL->(powersetI->(forall (A:fofType) (Xphi:(fofType->Prop)), ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A))))) of role conjecture named sepInPowerset
% Conjecture to prove = (dsetconstrEL->(powersetI->(forall (A:fofType) (Xphi:(fofType->Prop)), ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(dsetconstrEL->(powersetI->(forall (A:fofType) (Xphi:(fofType->Prop)), ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A)))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter powerset:(fofType->fofType).
% Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)).
% Definition dsetconstrEL:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A))):Prop.
% Definition powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))):Prop.
% Trying to prove (dsetconstrEL->(powersetI->(forall (A:fofType) (Xphi:(fofType->Prop)), ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A)))))
% Found x10:=(x1 Xphi):(forall (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A)))
% Found (x1 Xphi) as proof of (forall (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx))))->((in Xx) A)))
% Found ((x A) Xphi) as proof of (forall (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx))))->((in Xx) A)))
% Found ((x A) Xphi) as proof of (forall (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx))))->((in Xx) A)))
% Found (x000 ((x A) Xphi)) as proof of ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A))
% Found ((x00 ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi)) as proof of ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A))
% Found (((x0 A) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi)) as proof of ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A))
% Found (fun (Xphi:(fofType->Prop))=> (((x0 A) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi))) as proof of ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A))
% Found (fun (A:fofType) (Xphi:(fofType->Prop))=> (((x0 A) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi))) as proof of (forall (Xphi:(fofType->Prop)), ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A)))
% Found (fun (x0:powersetI) (A:fofType) (Xphi:(fofType->Prop))=> (((x0 A) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi))) as proof of (forall (A:fofType) (Xphi:(fofType->Prop)), ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A)))
% Found (fun (x:dsetconstrEL) (x0:powersetI) (A:fofType) (Xphi:(fofType->Prop))=> (((x0 A) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi))) as proof of (powersetI->(forall (A:fofType) (Xphi:(fofType->Prop)), ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A))))
% Found (fun (x:dsetconstrEL) (x0:powersetI) (A:fofType) (Xphi:(fofType->Prop))=> (((x0 A) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi))) as proof of (dsetconstrEL->(powersetI->(forall (A:fofType) (Xphi:(fofType->Prop)), ((in ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) (powerset A)))))
% Got proof (fun (x:dsetconstrEL) (x0:powersetI) (A:fofType) (Xphi:(fofType->Prop))=> (((x0 A) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi)))
% Time elapsed = 0.076637s
% node=13 cost=-107.000000 depth=10
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:dsetconstrEL) (x0:powersetI) (A:fofType) (Xphi:(fofType->Prop))=> (((x0 A) ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))) ((x A) Xphi)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------