TSTP Solution File: SEU682^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU682^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 : n112.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:48 EDT 2014
% Result : Theorem 0.41s
% Output : Proof 0.41s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU682^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n112.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 11:09:31 CDT 2014
% % CPUTime : 0.41
% 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 0x2a2a908>, <kernel.DependentProduct object at 0x2a2a320>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x2a7b680>, <kernel.DependentProduct object at 0x2a2a320>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x2a2a950>, <kernel.DependentProduct object at 0x2a29d40>) of role type named kpair_type
% Using role type
% Declaring kpair:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x2a29170>, <kernel.DependentProduct object at 0x2a2a950>) of role type named cartprod_type
% Using role type
% Declaring cartprod:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x2a29cf8>, <kernel.DependentProduct object at 0x2a2a0e0>) of role type named breln_type
% Using role type
% Declaring breln:(fofType->(fofType->(fofType->Prop)))
% FOF formula (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))) of role definition named breln
% A new definition: (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))))
% Defined: breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))
% FOF formula (<kernel.Constant object at 0x2a2a950>, <kernel.Sort object at 0x250f5a8>) of role type named brelnall1_type
% Using role type
% Declaring brelnall1:Prop
% FOF formula (((eq Prop) brelnall1) (forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx)))))))) of role definition named brelnall1
% A new definition: (((eq Prop) brelnall1) (forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx))))))))
% Defined: brelnall1:=(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx)))))))
% FOF formula (brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx)))))))) of role conjecture named brelnall2
% Conjecture to prove = (brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx)))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx))))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter subset:(fofType->(fofType->Prop)).
% Parameter kpair:(fofType->(fofType->fofType)).
% Parameter cartprod:(fofType->(fofType->fofType)).
% Definition breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))):(fofType->(fofType->(fofType->Prop))).
% Definition brelnall1:=(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx))))))):Prop.
% Trying to prove (brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx))))))))
% Found x:brelnall1
% Found (fun (x:brelnall1)=> x) as proof of (forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx)))))))
% Found (fun (x:brelnall1)=> x) as proof of (brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx))))))))
% Got proof (fun (x:brelnall1)=> x)
% Time elapsed = 0.088896s
% node=1 cost=3.000000 depth=1
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:brelnall1)=> x)
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------