↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU540^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 : n089.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:25 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  : SEU540^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n089.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:35:26 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 0x255b4d0>, <kernel.DependentProduct object at 0x255bd88>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x255cf38>, <kernel.Single object at 0x255b488>) of role type named emptyset_type
% Using role type
% Declaring emptyset:fofType
% FOF formula (<kernel.Constant object at 0x255bd88>, <kernel.DependentProduct object at 0x255b3f8>) of role type named powerset_type
% Using role type
% Declaring powerset:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x255b908>, <kernel.DependentProduct object at 0x255b7a0>) of role type named dsetconstr_type
% Using role type
% Declaring dsetconstr:(fofType->((fofType->Prop)->fofType))
% FOF formula (<kernel.Constant object at 0x255b248>, <kernel.Sort object at 0x204b128>) of role type named dsetconstrI_type
% Using role type
% Declaring dsetconstrI:Prop
% FOF formula (((eq Prop) dsetconstrI) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))))) of role definition named dsetconstrI
% A new definition: (((eq Prop) dsetconstrI) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))))
% Defined: dsetconstrI:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))))
% FOF formula (<kernel.Constant object at 0x2413ef0>, <kernel.DependentProduct object at 0x255b518>) of role type named prop2set_type
% Using role type
% Declaring prop2set:(Prop->fofType)
% FOF formula (((eq (Prop->fofType)) prop2set) (fun (Xphi:Prop)=> ((dsetconstr (powerset emptyset)) (fun (Xx:fofType)=> Xphi)))) of role definition named prop2set
% A new definition: (((eq (Prop->fofType)) prop2set) (fun (Xphi:Prop)=> ((dsetconstr (powerset emptyset)) (fun (Xx:fofType)=> Xphi))))
% Defined: prop2set:=(fun (Xphi:Prop)=> ((dsetconstr (powerset emptyset)) (fun (Xx:fofType)=> Xphi)))
% FOF formula (<kernel.Constant object at 0x255b518>, <kernel.Sort object at 0x204b128>) 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 (dsetconstrI->(powersetI->(forall (Xphi:Prop), (Xphi->((in emptyset) (prop2set Xphi)))))) of role conjecture named prop2setI
% Conjecture to prove = (dsetconstrI->(powersetI->(forall (Xphi:Prop), (Xphi->((in emptyset) (prop2set Xphi)))))):Prop
% We need to prove ['(dsetconstrI->(powersetI->(forall (Xphi:Prop), (Xphi->((in emptyset) (prop2set Xphi))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter emptyset:fofType.
% Parameter powerset:(fofType->fofType).
% Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)).
% Definition dsetconstrI:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))):Prop.
% Definition prop2set:=(fun (Xphi:Prop)=> ((dsetconstr (powerset emptyset)) (fun (Xx:fofType)=> Xphi))):(Prop->fofType).
% Definition powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))):Prop.
% Trying to prove (dsetconstrI->(powersetI->(forall (Xphi:Prop), (Xphi->((in emptyset) (prop2set Xphi))))))
% Found x1:Xphi
% Found x1 as proof of Xphi
% Found x3:((in Xx) emptyset)
% Found (fun (x3:((in Xx) emptyset))=> x3) as proof of ((in Xx) emptyset)
% Found (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3) as proof of (((in Xx) emptyset)->((in Xx) emptyset))
% Found (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3) as proof of (forall (Xx:fofType), (((in Xx) emptyset)->((in Xx) emptyset)))
% Found (x000 (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3)) as proof of ((in emptyset) (powerset emptyset))
% Found ((x00 emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3)) as proof of ((in emptyset) (powerset emptyset))
% Found (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3)) as proof of ((in emptyset) (powerset emptyset))
% Found (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3)) as proof of ((in emptyset) (powerset emptyset))
% Found ((x200 (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1) as proof of ((in emptyset) (prop2set Xphi))
% Found (((x20 emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1) as proof of ((in emptyset) (prop2set Xphi))
% Found ((((x2 (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1) as proof of ((in emptyset) (prop2set Xphi))
% Found (((((x (powerset emptyset)) (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1) as proof of ((in emptyset) (prop2set Xphi))
% Found (fun (x1:Xphi)=> (((((x (powerset emptyset)) (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1)) as proof of ((in emptyset) (prop2set Xphi))
% Found (fun (Xphi:Prop) (x1:Xphi)=> (((((x (powerset emptyset)) (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1)) as proof of (Xphi->((in emptyset) (prop2set Xphi)))
% Found (fun (x0:powersetI) (Xphi:Prop) (x1:Xphi)=> (((((x (powerset emptyset)) (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1)) as proof of (forall (Xphi:Prop), (Xphi->((in emptyset) (prop2set Xphi))))
% Found (fun (x:dsetconstrI) (x0:powersetI) (Xphi:Prop) (x1:Xphi)=> (((((x (powerset emptyset)) (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1)) as proof of (powersetI->(forall (Xphi:Prop), (Xphi->((in emptyset) (prop2set Xphi)))))
% Found (fun (x:dsetconstrI) (x0:powersetI) (Xphi:Prop) (x1:Xphi)=> (((((x (powerset emptyset)) (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1)) as proof of (dsetconstrI->(powersetI->(forall (Xphi:Prop), (Xphi->((in emptyset) (prop2set Xphi))))))
% Got proof (fun (x:dsetconstrI) (x0:powersetI) (Xphi:Prop) (x1:Xphi)=> (((((x (powerset emptyset)) (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1))
% Time elapsed = 0.134882s
% node=36 cost=207.000000 depth=15
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:dsetconstrI) (x0:powersetI) (Xphi:Prop) (x1:Xphi)=> (((((x (powerset emptyset)) (fun (x6:fofType)=> Xphi)) emptyset) (((x0 emptyset) emptyset) (fun (Xx:fofType) (x3:((in Xx) emptyset))=> x3))) x1))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------