TSTP Solution File: SEV410^5 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEV410^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 : n184.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:34:09 EDT 2014
% Result : Theorem 0.44s
% Output : Proof 0.44s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEV410^5 : TPTP v6.1.0. Released v4.0.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n184.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 09:09:56 CDT 2014
% % CPUTime : 0.44
% 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 0xc88830>, <kernel.DependentProduct object at 0xc88f38>) of role type named cA
% Using role type
% Declaring cA:(fofType->Prop)
% FOF formula (<kernel.Constant object at 0xe86200>, <kernel.DependentProduct object at 0xc88ef0>) of role type named cP
% Using role type
% Declaring cP:((fofType->Prop)->Prop)
% FOF formula (<kernel.Constant object at 0xc88dd0>, <kernel.DependentProduct object at 0xc88c68>) of role type named cB
% Using role type
% Declaring cB:(fofType->Prop)
% FOF formula ((cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))->((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx))))))) of role conjecture named cSV1_pme
% Conjecture to prove = ((cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))->((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['((cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))->((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))))']
% Parameter fofType:Type.
% Parameter cA:(fofType->Prop).
% Parameter cP:((fofType->Prop)->Prop).
% Parameter cB:(fofType->Prop).
% Trying to prove ((cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))->((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))))
% Found x:(cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))
% Instantiate: x0:=(fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))):(fofType->Prop)
% Found x as proof of (cP x0)
% Found x00:(cA Xx)
% Instantiate: x0:=cA:(fofType->Prop)
% Found (fun (x00:(cA Xx))=> x00) as proof of (x0 Xx)
% Found (fun (Xx:fofType) (x00:(cA Xx))=> x00) as proof of ((cA Xx)->(x0 Xx))
% Found (fun (Xx:fofType) (x00:(cA Xx))=> x00) as proof of (forall (Xx:fofType), ((cA Xx)->(x0 Xx)))
% Found or_introl00:=(or_introl0 (cB Xx)):((cA Xx)->((or (cA Xx)) (cB Xx)))
% Found (or_introl0 (cB Xx)) as proof of ((cA Xx)->(x0 Xx))
% Found ((or_introl (cA Xx)) (cB Xx)) as proof of ((cA Xx)->(x0 Xx))
% Found (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx))) as proof of ((cA Xx)->(x0 Xx))
% Found (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx))) as proof of (forall (Xx:fofType), ((cA Xx)->(x0 Xx)))
% Found ((conj00 x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx)))) as proof of ((and (cP x0)) (forall (Xx:fofType), ((cA Xx)->(x0 Xx))))
% Found (((conj0 (forall (Xx:fofType), ((cA Xx)->(x0 Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx)))) as proof of ((and (cP x0)) (forall (Xx:fofType), ((cA Xx)->(x0 Xx))))
% Found ((((conj (cP x0)) (forall (Xx:fofType), ((cA Xx)->(x0 Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx)))) as proof of ((and (cP x0)) (forall (Xx:fofType), ((cA Xx)->(x0 Xx))))
% Found ((((conj (cP x0)) (forall (Xx:fofType), ((cA Xx)->(x0 Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx)))) as proof of ((and (cP x0)) (forall (Xx:fofType), ((cA Xx)->(x0 Xx))))
% Found (ex_intro000 ((((conj (cP x0)) (forall (Xx:fofType), ((cA Xx)->(x0 Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx))))) as proof of ((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx))))))
% Found ((ex_intro00 (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))) ((((conj (cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))) (forall (Xx:fofType), ((cA Xx)->((fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))) Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx))))) as proof of ((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx))))))
% Found (((ex_intro0 (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))) (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))) ((((conj (cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))) (forall (Xx:fofType), ((cA Xx)->((fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))) Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx))))) as proof of ((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx))))))
% Found ((((ex_intro (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))) (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))) ((((conj (cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))) (forall (Xx:fofType), ((cA Xx)->((fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))) Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx))))) as proof of ((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx))))))
% Found (fun (x:(cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))))=> ((((ex_intro (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))) (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))) ((((conj (cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))) (forall (Xx:fofType), ((cA Xx)->((fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))) Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx)))))) as proof of ((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx))))))
% Found (fun (x:(cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))))=> ((((ex_intro (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))) (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))) ((((conj (cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))) (forall (Xx:fofType), ((cA Xx)->((fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))) Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx)))))) as proof of ((cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))->((ex (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))))
% Got proof (fun (x:(cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))))=> ((((ex_intro (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))) (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))) ((((conj (cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))) (forall (Xx:fofType), ((cA Xx)->((fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))) Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx))))))
% Time elapsed = 0.130022s
% node=22 cost=201.000000 depth=13
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:(cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))))=> ((((ex_intro (fofType->Prop)) (fun (Xu:(fofType->Prop))=> ((and (cP Xu)) (forall (Xx:fofType), ((cA Xx)->(Xu Xx)))))) (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx)))) ((((conj (cP (fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))))) (forall (Xx:fofType), ((cA Xx)->((fun (Xx:fofType)=> ((or (cA Xx)) (cB Xx))) Xx)))) x) (fun (Xx:fofType)=> ((or_introl (cA Xx)) (cB Xx))))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------