TSTP Solution File: SEV253^5 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEV253^5 : TPTP v6.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n113.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:57 EDT 2014
% Result : Unknown 3.85s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEV253^5 : TPTP v6.1.0. Released v4.0.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n113.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 08:37:56 CDT 2014
% % CPUTime : 3.85
% 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 0x21f5710>, <kernel.DependentProduct object at 0x21f5ef0>) of role type named cL
% Using role type
% Declaring cL:((fofType->Prop)->Prop)
% FOF formula (<kernel.Constant object at 0x21f53f8>, <kernel.DependentProduct object at 0x21f5dd0>) of role type named cG
% Using role type
% Declaring cG:((fofType->Prop)->Prop)
% FOF formula (<kernel.Constant object at 0x21f58c0>, <kernel.DependentProduct object at 0x21f5710>) of role type named cF
% Using role type
% Declaring cF:(((fofType->Prop)->Prop)->Prop)
% FOF formula (((and ((and ((and (forall (C:((fofType->Prop)->Prop)), (((and (forall (Xx:(fofType->Prop)), ((C Xx)->(cG Xx)))) (forall (Xx:fofType), ((ex (fofType->Prop)) (fun (Y:(fofType->Prop))=> ((and (C Y)) (Y Xx))))))->((ex ((fofType->Prop)->Prop)) (fun (D:((fofType->Prop)->Prop))=> ((and ((and (cF D)) (forall (Xx:(fofType->Prop)), ((D Xx)->(C Xx))))) (forall (Xx:fofType), ((ex (fofType->Prop)) (fun (Y:(fofType->Prop))=> ((and (D Y)) (Y Xx))))))))))) (forall (C:((fofType->Prop)->Prop)), ((cF C)->(cF (fun (U:(fofType->Prop))=> (C (fun (Xx:fofType)=> ((U Xx)->False))))))))) (forall (B:((fofType->Prop)->Prop)), (((and (cF B)) (forall (Xx:(fofType->Prop)), ((B Xx)->(cL Xx))))->((ex fofType) (fun (Xm:fofType)=> (forall (Z:(fofType->Prop)), ((B Z)->(Z Xm))))))))) (forall (Z:(fofType->Prop)), ((cL Z)->(cG (fun (Xx:fofType)=> ((Z Xx)->False))))))->((ex fofType) (fun (Xa:fofType)=> (forall (Z:(fofType->Prop)), ((cL Z)->(Z Xa)))))) of role conjecture named cTHM630_pme
% Conjecture to prove = (((and ((and ((and (forall (C:((fofType->Prop)->Prop)), (((and (forall (Xx:(fofType->Prop)), ((C Xx)->(cG Xx)))) (forall (Xx:fofType), ((ex (fofType->Prop)) (fun (Y:(fofType->Prop))=> ((and (C Y)) (Y Xx))))))->((ex ((fofType->Prop)->Prop)) (fun (D:((fofType->Prop)->Prop))=> ((and ((and (cF D)) (forall (Xx:(fofType->Prop)), ((D Xx)->(C Xx))))) (forall (Xx:fofType), ((ex (fofType->Prop)) (fun (Y:(fofType->Prop))=> ((and (D Y)) (Y Xx))))))))))) (forall (C:((fofType->Prop)->Prop)), ((cF C)->(cF (fun (U:(fofType->Prop))=> (C (fun (Xx:fofType)=> ((U Xx)->False))))))))) (forall (B:((fofType->Prop)->Prop)), (((and (cF B)) (forall (Xx:(fofType->Prop)), ((B Xx)->(cL Xx))))->((ex fofType) (fun (Xm:fofType)=> (forall (Z:(fofType->Prop)), ((B Z)->(Z Xm))))))))) (forall (Z:(fofType->Prop)), ((cL Z)->(cG (fun (Xx:fofType)=> ((Z Xx)->False))))))->((ex fofType) (fun (Xa:fofType)=> (forall (Z:(fofType->Prop)), ((cL Z)->(Z Xa)))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(((and ((and ((and (forall (C:((fofType->Prop)->Prop)), (((and (forall (Xx:(fofType->Prop)), ((C Xx)->(cG Xx)))) (forall (Xx:fofType), ((ex (fofType->Prop)) (fun (Y:(fofType->Prop))=> ((and (C Y)) (Y Xx))))))->((ex ((fofType->Prop)->Prop)) (fun (D:((fofType->Prop)->Prop))=> ((and ((and (cF D)) (forall (Xx:(fofType->Prop)), ((D Xx)->(C Xx))))) (forall (Xx:fofType), ((ex (fofType->Prop)) (fun (Y:(fofType->Prop))=> ((and (D Y)) (Y Xx))))))))))) (forall (C:((fofType->Prop)->Prop)), ((cF C)->(cF (fun (U:(fofType->Prop))=> (C (fun (Xx:fofType)=> ((U Xx)->False))))))))) (forall (B:((fofType->Prop)->Prop)), (((and (cF B)) (forall (Xx:(fofType->Prop)), ((B Xx)->(cL Xx))))->((ex fofType) (fun (Xm:fofType)=> (forall (Z:(fofType->Prop)), ((B Z)->(Z Xm))))))))) (forall (Z:(fofType->Prop)), ((cL Z)->(cG (fun (Xx:fofType)=> ((Z Xx)->False))))))->((ex fofType) (fun (Xa:fofType)=> (forall (Z:(fofType->Prop)), ((cL Z)->(Z Xa))))))']
% Parameter fofType:Type.
% Parameter cL:((fofType->Prop)->Prop).
% Parameter cG:((fofType->Prop)->Prop).
% Parameter cF:(((fofType->Prop)->Prop)->Prop).
% Trying to prove (((and ((and ((and (forall (C:((fofType->Prop)->Prop)), (((and (forall (Xx:(fofType->Prop)), ((C Xx)->(cG Xx)))) (forall (Xx:fofType), ((ex (fofType->Prop)) (fun (Y:(fofType->Prop))=> ((and (C Y)) (Y Xx))))))->((ex ((fofType->Prop)->Prop)) (fun (D:((fofType->Prop)->Prop))=> ((and ((and (cF D)) (forall (Xx:(fofType->Prop)), ((D Xx)->(C Xx))))) (forall (Xx:fofType), ((ex (fofType->Prop)) (fun (Y:(fofType->Prop))=> ((and (D Y)) (Y Xx))))))))))) (forall (C:((fofType->Prop)->Prop)), ((cF C)->(cF (fun (U:(fofType->Prop))=> (C (fun (Xx:fofType)=> ((U Xx)->False))))))))) (forall (B:((fofType->Prop)->Prop)), (((and (cF B)) (forall (Xx:(fofType->Prop)), ((B Xx)->(cL Xx))))->((ex fofType) (fun (Xm:fofType)=> (forall (Z:(fofType->Prop)), ((B Z)->(Z Xm))))))))) (forall (Z:(fofType->Prop)), ((cL Z)->(cG (fun (Xx:fofType)=> ((Z Xx)->False))))))->((ex fofType) (fun (Xa:fofType)=> (forall (Z:(fofType->Prop)), ((cL Z)->(Z Xa))))))
% Found x4:(cL Xx)
% Found (fun (x4:(cL Xx))=> x4) as proof of (cL Xx)
% Found (fun (Xx:(fofType->Prop)) (x4:(cL Xx))=> x4) as proof of ((cL Xx)->(cL Xx))
% Found (fun (Xx:(fofType->Prop)) (x4:(cL Xx))=> x4) as proof of (forall (Xx:(fofType->Prop)), ((cL Xx)->(cL Xx)))
% Found x4:(cL Xx)
% Found (fun (x4:(cL Xx))=> x4) as proof of (cL Xx)
% Found (fun (Xx:(fofType->Prop)) (x4:(cL Xx))=> x4) as proof of ((cL Xx)->(cL Xx))
% Found (fun (Xx:(fofType->Prop)) (x4:(cL Xx))=> x4) as proof of (forall (Xx:(fofType->Prop)), ((cL Xx)->(cL Xx)))
% Found x6:(cL Xx)
% Found (fun (x6:(cL Xx))=> x6) as proof of (cL Xx)
% Found (fun (Xx:(fofType->Prop)) (x6:(cL Xx))=> x6) as proof of ((cL Xx)->(cL Xx))
% Found (fun (Xx:(fofType->Prop)) (x6:(cL Xx))=> x6) as proof of (forall (Xx:(fofType->Prop)), ((cL Xx)->(cL Xx)))
% Found x6:(cL Xx)
% Found (fun (x6:(cL Xx))=> x6) as proof of (cL Xx)
% Found (fun (Xx:(fofType->Prop)) (x6:(cL Xx))=> x6) as proof of ((cL Xx)->(cL Xx))
% Found (fun (Xx:(fofType->Prop)) (x6:(cL Xx))=> x6) as proof of (forall (Xx:(fofType->Prop)), ((cL Xx)->(cL Xx)))
% Found x6:(cL Xx)
% Found (fun (x6:(cL Xx))=> x6) as proof of (cL Xx)
% Found (fun (Xx:(fofType->Prop)) (x6:(cL Xx))=> x6) as proof of ((cL Xx)->(cL Xx))
% Found (fun (Xx:(fofType->Prop)) (x6:(cL Xx))=> x6) as proof of (forall (Xx:(fofType->Prop)), ((cL Xx)->(cL Xx)))
% Found x6:(cL Xx)
% Found (fun (x6:(cL Xx))=> x6) as proof of (cL Xx)
% Found (fun (Xx:(fofType->Prop)) (x6:(cL Xx))=> x6) as proof of ((cL Xx)->(cL Xx))
% Found (fun (Xx:(fofType->Prop)) (x6:(cL Xx))=> x6) as proof of (forall (Xx:(fofType->Prop)), ((cL Xx)->(cL Xx)))
% % SZS status GaveUp for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------