TSTP Solution File: SEV411^5 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEV411^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 : n110.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.39s
% Output : Proof 0.39s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEV411^5 : TPTP v6.1.0. Released v4.0.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n110.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:10:06 CDT 2014
% % CPUTime : 0.39
% 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 0xc69950>, <kernel.DependentProduct object at 0xc69ea8>) of role type named cB
% Using role type
% Declaring cB:(fofType->Prop)
% FOF formula (<kernel.Constant object at 0xe47560>, <kernel.DependentProduct object at 0xc69b00>) of role type named cA
% Using role type
% Declaring cA:(fofType->Prop)
% FOF formula (((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))->(forall (Xx:fofType), ((cA Xx)->(cB Xx)))) of role conjecture named cDUAL_EG1_pme
% Conjecture to prove = (((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))->(forall (Xx:fofType), ((cA Xx)->(cB Xx)))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))->(forall (Xx:fofType), ((cA Xx)->(cB Xx))))']
% Parameter fofType:Type.
% Parameter cB:(fofType->Prop).
% Parameter cA:(fofType->Prop).
% Trying to prove (((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))->(forall (Xx:fofType), ((cA Xx)->(cB Xx))))
% Found x100:=(x10 x0):(cB Xx)
% Found (x10 x0) as proof of (cB Xx)
% Found ((x1 Xx) x0) as proof of (cB Xx)
% Found (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0)) as proof of (cB Xx)
% Found (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0)) as proof of ((forall (Xx0:fofType), ((cA Xx0)->(cB Xx0)))->(cB Xx))
% Found x100:=(x10 x0):(cB Xx)
% Found (x10 x0) as proof of (cB Xx)
% Found ((x1 Xx) x0) as proof of (cB Xx)
% Found (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0)) as proof of (cB Xx)
% Found (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0)) as proof of ((forall (Xx0:fofType), ((cA Xx0)->(cB Xx0)))->(cB Xx))
% Found ((or_ind00 (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) as proof of (cB Xx)
% Found (((or_ind0 (cB Xx)) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) as proof of (cB Xx)
% Found ((((fun (P:Prop) (x1:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P)) (x2:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P))=> ((((((or_ind (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) P) x1) x2) x)) (cB Xx)) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) as proof of (cB Xx)
% Found (fun (x0:(cA Xx))=> ((((fun (P:Prop) (x1:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P)) (x2:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P))=> ((((((or_ind (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) P) x1) x2) x)) (cB Xx)) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0)))) as proof of (cB Xx)
% Found (fun (Xx:fofType) (x0:(cA Xx))=> ((((fun (P:Prop) (x1:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P)) (x2:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P))=> ((((((or_ind (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) P) x1) x2) x)) (cB Xx)) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0)))) as proof of ((cA Xx)->(cB Xx))
% Found (fun (x:((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))) (Xx:fofType) (x0:(cA Xx))=> ((((fun (P:Prop) (x1:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P)) (x2:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P))=> ((((((or_ind (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) P) x1) x2) x)) (cB Xx)) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0)))) as proof of (forall (Xx:fofType), ((cA Xx)->(cB Xx)))
% Found (fun (x:((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))) (Xx:fofType) (x0:(cA Xx))=> ((((fun (P:Prop) (x1:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P)) (x2:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P))=> ((((((or_ind (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) P) x1) x2) x)) (cB Xx)) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0)))) as proof of (((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))->(forall (Xx:fofType), ((cA Xx)->(cB Xx))))
% Got proof (fun (x:((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))) (Xx:fofType) (x0:(cA Xx))=> ((((fun (P:Prop) (x1:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P)) (x2:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P))=> ((((((or_ind (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) P) x1) x2) x)) (cB Xx)) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))))
% Time elapsed = 0.082196s
% node=13 cost=136.000000 depth=10
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:((or (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx))))) (Xx:fofType) (x0:(cA Xx))=> ((((fun (P:Prop) (x1:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P)) (x2:((forall (Xx:fofType), ((cA Xx)->(cB Xx)))->P))=> ((((((or_ind (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) (forall (Xx:fofType), ((cA Xx)->(cB Xx)))) P) x1) x2) x)) (cB Xx)) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))) (fun (x1:(forall (Xx0:fofType), ((cA Xx0)->(cB Xx0))))=> ((x1 Xx) x0))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------