TSTP Solution File: SEU586^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU586^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 : n095.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:32:32 EDT 2014
% Result : Theorem 0.62s
% Output : Proof 0.62s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU586^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n095.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 10:48:51 CDT 2014
% % CPUTime : 0.62
% 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 0x2160c20>, <kernel.DependentProduct object at 0x2160dd0>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x2558290>, <kernel.DependentProduct object at 0x2160dd0>) of role type named binunion_type
% Using role type
% Declaring binunion:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x2160680>, <kernel.Sort object at 0x20406c8>) of role type named binunionEcases_type
% Using role type
% Declaring binunionEcases:Prop
% FOF formula (((eq Prop) binunionEcases) (forall (A:fofType) (B:fofType) (Xx:fofType) (Xphi:Prop), (((in Xx) ((binunion A) B))->((((in Xx) A)->Xphi)->((((in Xx) B)->Xphi)->Xphi))))) of role definition named binunionEcases
% A new definition: (((eq Prop) binunionEcases) (forall (A:fofType) (B:fofType) (Xx:fofType) (Xphi:Prop), (((in Xx) ((binunion A) B))->((((in Xx) A)->Xphi)->((((in Xx) B)->Xphi)->Xphi)))))
% Defined: binunionEcases:=(forall (A:fofType) (B:fofType) (Xx:fofType) (Xphi:Prop), (((in Xx) ((binunion A) B))->((((in Xx) A)->Xphi)->((((in Xx) B)->Xphi)->Xphi))))
% FOF formula (binunionEcases->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B))))) of role conjecture named binunionE
% Conjecture to prove = (binunionEcases->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(binunionEcases->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B)))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter binunion:(fofType->(fofType->fofType)).
% Definition binunionEcases:=(forall (A:fofType) (B:fofType) (Xx:fofType) (Xphi:Prop), (((in Xx) ((binunion A) B))->((((in Xx) A)->Xphi)->((((in Xx) B)->Xphi)->Xphi)))):Prop.
% Trying to prove (binunionEcases->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B)))))
% Found x0:((in Xx) ((binunion A) B))
% Instantiate: A0:=A:fofType;Xx0:=Xx:fofType;B0:=B:fofType
% Found x0 as proof of ((in Xx0) ((binunion A0) B0))
% Found or_introl00:=(or_introl0 ((in Xx) B)):(((in Xx0) A0)->((or ((in Xx0) A0)) ((in Xx) B)))
% Found (or_introl0 ((in Xx) B)) as proof of (((in Xx0) A0)->((or ((in Xx) A)) ((in Xx) B)))
% Found ((or_introl ((in Xx0) A0)) ((in Xx) B)) as proof of (((in Xx0) A0)->((or ((in Xx) A)) ((in Xx) B)))
% Found ((or_introl ((in Xx0) A0)) ((in Xx) B)) as proof of (((in Xx0) A0)->((or ((in Xx) A)) ((in Xx) B)))
% Found or_intror00:=(or_intror0 ((in Xx0) B0)):(((in Xx0) B0)->((or ((in Xx) A)) ((in Xx0) B0)))
% Found (or_intror0 ((in Xx0) B0)) as proof of (((in Xx0) B0)->((or ((in Xx) A)) ((in Xx) B)))
% Found ((or_intror ((in Xx) A)) ((in Xx0) B0)) as proof of (((in Xx0) B0)->((or ((in Xx) A)) ((in Xx) B)))
% Found ((or_intror ((in Xx) A)) ((in Xx0) B0)) as proof of (((in Xx0) B0)->((or ((in Xx) A)) ((in Xx) B)))
% Found (((x1000 x0) ((or_introl ((in Xx0) A0)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx0) B0))) as proof of ((or ((in Xx) A)) ((in Xx) B))
% Found ((((x100 ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx0) A0)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx0) B0))) as proof of ((or ((in Xx) A)) ((in Xx) B))
% Found (((((x10 Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A0)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B0))) as proof of ((or ((in Xx) A)) ((in Xx) B))
% Found ((((((x1 B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A0)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B))) as proof of ((or ((in Xx) A)) ((in Xx) B))
% Found (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B))) as proof of ((or ((in Xx) A)) ((in Xx) B))
% Found (fun (x0:((in Xx) ((binunion A) B)))=> (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B)))) as proof of ((or ((in Xx) A)) ((in Xx) B))
% Found (fun (Xx:fofType) (x0:((in Xx) ((binunion A) B)))=> (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B)))) as proof of (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B)))
% Found (fun (B:fofType) (Xx:fofType) (x0:((in Xx) ((binunion A) B)))=> (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B)))) as proof of (forall (Xx:fofType), (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B))))
% Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) ((binunion A) B)))=> (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B)))) as proof of (forall (B:fofType) (Xx:fofType), (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B))))
% Found (fun (x:binunionEcases) (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) ((binunion A) B)))=> (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B)))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B))))
% Found (fun (x:binunionEcases) (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) ((binunion A) B)))=> (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B)))) as proof of (binunionEcases->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binunion A) B))->((or ((in Xx) A)) ((in Xx) B)))))
% Got proof (fun (x:binunionEcases) (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) ((binunion A) B)))=> (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B))))
% Time elapsed = 0.300449s
% node=92 cost=1746.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:binunionEcases) (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) ((binunion A) B)))=> (((((((x A) B) Xx) ((or ((in Xx) A)) ((in Xx) B))) x0) ((or_introl ((in Xx) A)) ((in Xx) B))) ((or_intror ((in Xx) A)) ((in Xx) B))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------