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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU807^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 : n183.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:11 EDT 2014

% Result   : Unknown 0.51s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU807^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n183.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:31:56 CDT 2014
% % CPUTime  : 0.51 
% 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 0x1bd7908>, <kernel.DependentProduct object at 0x1982830>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x166dea8>, <kernel.Single object at 0x1bd7c20>) of role type named emptyset_type
% Using role type
% Declaring emptyset:fofType
% FOF formula (<kernel.Constant object at 0x1bd7830>, <kernel.DependentProduct object at 0x19821b8>) of role type named setadjoin_type
% Using role type
% Declaring setadjoin:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x1bd7f38>, <kernel.Sort object at 0x1667368>) of role type named foundationAx_type
% Using role type
% Declaring foundationAx:Prop
% FOF formula (((eq Prop) foundationAx) (forall (A:fofType), (((ex fofType) (fun (Xx:fofType)=> ((in Xx) A)))->((ex fofType) (fun (B:fofType)=> ((and ((in B) A)) (((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) B)) ((in Xx) A))))->False))))))) of role definition named foundationAx
% A new definition: (((eq Prop) foundationAx) (forall (A:fofType), (((ex fofType) (fun (Xx:fofType)=> ((in Xx) A)))->((ex fofType) (fun (B:fofType)=> ((and ((in B) A)) (((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) B)) ((in Xx) A))))->False)))))))
% Defined: foundationAx:=(forall (A:fofType), (((ex fofType) (fun (Xx:fofType)=> ((in Xx) A)))->((ex fofType) (fun (B:fofType)=> ((and ((in B) A)) (((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) B)) ((in Xx) A))))->False))))))
% FOF formula (<kernel.Constant object at 0x1bd7710>, <kernel.Sort object at 0x1667368>) of role type named setadjoinIL_type
% Using role type
% Declaring setadjoinIL:Prop
% FOF formula (((eq Prop) setadjoinIL) (forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy)))) of role definition named setadjoinIL
% A new definition: (((eq Prop) setadjoinIL) (forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy))))
% Defined: setadjoinIL:=(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy)))
% FOF formula (<kernel.Constant object at 0x1bd7710>, <kernel.Sort object at 0x1667368>) of role type named setadjoinIR_type
% Using role type
% Declaring setadjoinIR:Prop
% FOF formula (((eq Prop) setadjoinIR) (forall (Xx:fofType) (A:fofType) (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A))))) of role definition named setadjoinIR
% A new definition: (((eq Prop) setadjoinIR) (forall (Xx:fofType) (A:fofType) (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A)))))
% Defined: setadjoinIR:=(forall (Xx:fofType) (A:fofType) (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A))))
% FOF formula (<kernel.Constant object at 0x1bd7c20>, <kernel.Sort object at 0x1667368>) of role type named in__Cong_type
% Using role type
% Declaring in__Cong:Prop
% FOF formula (((eq Prop) in__Cong) (forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))))) of role definition named in__Cong
% A new definition: (((eq Prop) in__Cong) (forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))))))
% Defined: in__Cong:=(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))))
% FOF formula (<kernel.Constant object at 0x19826c8>, <kernel.Sort object at 0x1667368>) of role type named upairset2E_type
% Using role type
% Declaring upairset2E:Prop
% FOF formula (((eq Prop) upairset2E) (forall (Xx:fofType) (Xy:fofType) (Xz:fofType), (((in Xz) ((setadjoin Xx) ((setadjoin Xy) emptyset)))->((or (((eq fofType) Xz) Xx)) (((eq fofType) Xz) Xy))))) of role definition named upairset2E
% A new definition: (((eq Prop) upairset2E) (forall (Xx:fofType) (Xy:fofType) (Xz:fofType), (((in Xz) ((setadjoin Xx) ((setadjoin Xy) emptyset)))->((or (((eq fofType) Xz) Xx)) (((eq fofType) Xz) Xy)))))
% Defined: upairset2E:=(forall (Xx:fofType) (Xy:fofType) (Xz:fofType), (((in Xz) ((setadjoin Xx) ((setadjoin Xy) emptyset)))->((or (((eq fofType) Xz) Xx)) (((eq fofType) Xz) Xy))))
% FOF formula (foundationAx->(setadjoinIL->(setadjoinIR->(in__Cong->(upairset2E->(forall (A:fofType) (B:fofType), (((in A) B)->(((in B) A)->False)))))))) of role conjecture named notinself2
% Conjecture to prove = (foundationAx->(setadjoinIL->(setadjoinIR->(in__Cong->(upairset2E->(forall (A:fofType) (B:fofType), (((in A) B)->(((in B) A)->False)))))))):Prop
% We need to prove ['(foundationAx->(setadjoinIL->(setadjoinIR->(in__Cong->(upairset2E->(forall (A:fofType) (B:fofType), (((in A) B)->(((in B) A)->False))))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter emptyset:fofType.
% Parameter setadjoin:(fofType->(fofType->fofType)).
% Definition foundationAx:=(forall (A:fofType), (((ex fofType) (fun (Xx:fofType)=> ((in Xx) A)))->((ex fofType) (fun (B:fofType)=> ((and ((in B) A)) (((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) B)) ((in Xx) A))))->False)))))):Prop.
% Definition setadjoinIL:=(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy))):Prop.
% Definition setadjoinIR:=(forall (Xx:fofType) (A:fofType) (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A)))):Prop.
% Definition in__Cong:=(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))))):Prop.
% Definition upairset2E:=(forall (Xx:fofType) (Xy:fofType) (Xz:fofType), (((in Xz) ((setadjoin Xx) ((setadjoin Xy) emptyset)))->((or (((eq fofType) Xz) Xx)) (((eq fofType) Xz) Xy)))):Prop.
% Trying to prove (foundationAx->(setadjoinIL->(setadjoinIR->(in__Cong->(upairset2E->(forall (A:fofType) (B:fofType), (((in A) B)->(((in B) A)->False))))))))
% % SZS status GaveUp for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------