TSTP Solution File: SEU771^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU771^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 : n189.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:33:04 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 : SEU771^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n189.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:26:16 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 0x2b49320>, <kernel.DependentProduct object at 0x2b497e8>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x2638b00>, <kernel.DependentProduct object at 0x2b497e8>) of role type named cartprod_type
% Using role type
% Declaring cartprod:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x2b49bd8>, <kernel.DependentProduct object at 0x2b496c8>) 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 0x2b497a0>, <kernel.DependentProduct object at 0x2b499e0>) of role type named dpsetconstr_type
% Using role type
% Declaring dpsetconstr:(fofType->(fofType->((fofType->(fofType->Prop))->fofType)))
% FOF formula (<kernel.Constant object at 0x2b49b48>, <kernel.Sort object at 0x2633128>) of role type named setOfPairsIsBReln_type
% Using role type
% Declaring setOfPairsIsBReln:Prop
% FOF formula (((eq Prop) setOfPairsIsBReln) (forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), (((breln A) B) (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))) of role definition named setOfPairsIsBReln
% A new definition: (((eq Prop) setOfPairsIsBReln) (forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), (((breln A) B) (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy))))))
% Defined: setOfPairsIsBReln:=(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), (((breln A) B) (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))
% FOF formula (<kernel.Constant object at 0x2b49bd8>, <kernel.DependentProduct object at 0x2b2b518>) of role type named breln1_type
% Using role type
% Declaring breln1:(fofType->(fofType->Prop))
% FOF formula (((eq (fofType->(fofType->Prop))) breln1) (fun (A:fofType) (R:fofType)=> (((breln A) A) R))) of role definition named breln1
% A new definition: (((eq (fofType->(fofType->Prop))) breln1) (fun (A:fofType) (R:fofType)=> (((breln A) A) R)))
% Defined: breln1:=(fun (A:fofType) (R:fofType)=> (((breln A) A) R))
% FOF formula (setOfPairsIsBReln->(forall (A:fofType) (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))) of role conjecture named setOfPairsIsBReln1
% Conjecture to prove = (setOfPairsIsBReln->(forall (A:fofType) (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(setOfPairsIsBReln->(forall (A:fofType) (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy))))))']
% Parameter fofType:Type.
% Parameter subset:(fofType->(fofType->Prop)).
% Parameter cartprod:(fofType->(fofType->fofType)).
% Definition breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))):(fofType->(fofType->(fofType->Prop))).
% Parameter dpsetconstr:(fofType->(fofType->((fofType->(fofType->Prop))->fofType))).
% Definition setOfPairsIsBReln:=(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), (((breln A) B) (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy))))):Prop.
% Definition breln1:=(fun (A:fofType) (R:fofType)=> (((breln A) A) R)):(fofType->(fofType->Prop)).
% Trying to prove (setOfPairsIsBReln->(forall (A:fofType) (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy))))))
% Found x00:=(x0 A):(forall (Xphi:(fofType->(fofType->Prop))), (((breln A) A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))
% Found (x0 A) as proof of (forall (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))
% Found ((x A) A) as proof of (forall (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))
% Found (fun (A:fofType)=> ((x A) A)) as proof of (forall (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))
% Found (fun (x:setOfPairsIsBReln) (A:fofType)=> ((x A) A)) as proof of (forall (A:fofType) (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))))
% Found (fun (x:setOfPairsIsBReln) (A:fofType)=> ((x A) A)) as proof of (setOfPairsIsBReln->(forall (A:fofType) (Xphi:(fofType->(fofType->Prop))), ((breln1 A) (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy))))))
% Got proof (fun (x:setOfPairsIsBReln) (A:fofType)=> ((x A) A))
% Time elapsed = 0.080178s
% node=6 cost=-184.000000 depth=4
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:setOfPairsIsBReln) (A:fofType)=> ((x A) A))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------