TSTP Solution File: SEV318^5 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEV318^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 : n116.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:02 EDT 2014
% Result : Timeout 300.02s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEV318^5 : TPTP v6.1.0. Released v4.0.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n116.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:49:36 CDT 2014
% % CPUTime : 300.02
% 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 0x11f1ea8>, <kernel.Type object at 0x11f1d40>) of role type named a_type
% Using role type
% Declaring a:Type
% FOF formula (forall (R:(a->(a->Prop))) (U:((a->Prop)->a)), (((and (forall (Xx:a) (Xy:a) (Xz:a), (((and ((R Xx) Xy)) ((R Xy) Xz))->((R Xx) Xz)))) (forall (Xs:(a->Prop)), ((and ((and (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))) (forall (Xj:a), ((forall (Xk:a), ((Xs Xk)->((R Xk) Xj)))->((R (U Xs)) Xj))))))->(forall (Xf:(a->a)), (((and (forall (Xx:a) (Xy:a), (((R Xx) Xy)->((R (Xf Xx)) (Xf Xy))))) (forall (Xx:a) (Xy:a), (((R Xx) Xy)->((R (Xf Xx)) (Xf Xy)))))->((ex a) (fun (Xw:a)=> ((and ((R Xw) (Xf Xw))) ((R (Xf Xw)) Xw)))))))) of role conjecture named cTHM145_B_pme
% Conjecture to prove = (forall (R:(a->(a->Prop))) (U:((a->Prop)->a)), (((and (forall (Xx:a) (Xy:a) (Xz:a), (((and ((R Xx) Xy)) ((R Xy) Xz))->((R Xx) Xz)))) (forall (Xs:(a->Prop)), ((and ((and (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))) (forall (Xj:a), ((forall (Xk:a), ((Xs Xk)->((R Xk) Xj)))->((R (U Xs)) Xj))))))->(forall (Xf:(a->a)), (((and (forall (Xx:a) (Xy:a), (((R Xx) Xy)->((R (Xf Xx)) (Xf Xy))))) (forall (Xx:a) (Xy:a), (((R Xx) Xy)->((R (Xf Xx)) (Xf Xy)))))->((ex a) (fun (Xw:a)=> ((and ((R Xw) (Xf Xw))) ((R (Xf Xw)) Xw)))))))):Prop
% Parameter a_DUMMY:a.
% We need to prove ['(forall (R:(a->(a->Prop))) (U:((a->Prop)->a)), (((and (forall (Xx:a) (Xy:a) (Xz:a), (((and ((R Xx) Xy)) ((R Xy) Xz))->((R Xx) Xz)))) (forall (Xs:(a->Prop)), ((and ((and (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))) (forall (Xj:a), ((forall (Xk:a), ((Xs Xk)->((R Xk) Xj)))->((R (U Xs)) Xj))))))->(forall (Xf:(a->a)), (((and (forall (Xx:a) (Xy:a), (((R Xx) Xy)->((R (Xf Xx)) (Xf Xy))))) (forall (Xx:a) (Xy:a), (((R Xx) Xy)->((R (Xf Xx)) (Xf Xy)))))->((ex a) (fun (Xw:a)=> ((and ((R Xw) (Xf Xw))) ((R (Xf Xw)) Xw))))))))']
% Parameter a:Type.
% Trying to prove (forall (R:(a->(a->Prop))) (U:((a->Prop)->a)), (((and (forall (Xx:a) (Xy:a) (Xz:a), (((and ((R Xx) Xy)) ((R Xy) Xz))->((R Xx) Xz)))) (forall (Xs:(a->Prop)), ((and ((and (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))) (forall (Xj:a), ((forall (Xk:a), ((Xs Xk)->((R Xk) Xj)))->((R (U Xs)) Xj))))))->(forall (Xf:(a->a)), (((and (forall (Xx:a) (Xy:a), (((R Xx) Xy)->((R (Xf Xx)) (Xf Xy))))) (forall (Xx:a) (Xy:a), (((R Xx) Xy)->((R (Xf Xx)) (Xf Xy)))))->((ex a) (fun (Xw:a)=> ((and ((R Xw) (Xf Xw))) ((R (Xf Xw)) Xw))))))))
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x6 as proof of ((R Xk) Xy)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x6 as proof of ((R Xk) Xy)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x6 as proof of ((R Xk) Xy)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);x5:=Xk:a
% Found (fun (x6:(Xs Xk))=> x6) as proof of ((R Xk) x5)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found (fun (x6:(Xs Xk))=> x6) as proof of ((R Xk) Xy)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);x3:=Xk:a
% Found (fun (x6:(Xs Xk))=> x6) as proof of ((R Xk) x3)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found (fun (x6:(Xs Xk))=> x6) as proof of ((R Xk) Xy)
% Found x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))
% Instantiate: Xy:=(U Xs):a
% Found x6 as proof of (forall (Xk:a), ((Xs Xk)->((R Xk) Xy)))
% Found (x40 x6) as proof of ((R x7) Xy)
% Found ((x4 Xy) x6) as proof of ((R x7) Xy)
% Found ((x4 Xy) x6) as proof of ((R x7) Xy)
% Found ((x4 Xy) x6) as proof of ((R x7) Xy)
% Found x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))
% Instantiate: x7:=(U Xs):a
% Found x6 as proof of (forall (Xk:a), ((Xs Xk)->((R Xk) x7)))
% Found (x40 x6) as proof of ((R Xy) x7)
% Found ((x4 x7) x6) as proof of ((R Xy) x7)
% Found ((x4 x7) x6) as proof of ((R Xy) x7)
% Found ((x4 x7) x6) as proof of ((R Xy) x7)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);x1:=Xk:a
% Found (fun (x6:(Xs Xk))=> x6) as proof of ((R Xk) x1)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found (fun (x6:(Xs Xk))=> x6) as proof of ((R Xk) Xy)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x6 as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x7:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))
% Instantiate: Xy:=(U Xs):a
% Found x7 as proof of (forall (Xk:a), ((Xs Xk)->((R Xk) Xy)))
% Found (x50 x7) as proof of ((R x3) Xy)
% Found ((x5 Xy) x7) as proof of ((R x3) Xy)
% Found ((x5 Xy) x7) as proof of ((R x3) Xy)
% Found ((x5 Xy) x7) as proof of ((R x3) Xy)
% Found x7:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))
% Instantiate: x3:=(U Xs):a
% Found x7 as proof of (forall (Xk:a), ((Xs Xk)->((R Xk) x3)))
% Found (x50 x7) as proof of ((R Xy) x3)
% Found ((x5 x3) x7) as proof of ((R Xy) x3)
% Found ((x5 x3) x7) as proof of ((R Xy) x3)
% Found ((x5 x3) x7) as proof of ((R Xy) x3)
% Found x7:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))
% Instantiate: Xy:=(U Xs):a
% Found x7 as proof of (forall (Xk:a), ((Xs Xk)->((R Xk) Xy)))
% Found (x40 x7) as proof of ((R x5) Xy)
% Found ((x4 Xy) x7) as proof of ((R x5) Xy)
% Found ((x4 Xy) x7) as proof of ((R x5) Xy)
% Found ((x4 Xy) x7) as proof of ((R x5) Xy)
% Found x7:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))
% Instantiate: x5:=(U Xs):a
% Found x7 as proof of (forall (Xk:a), ((Xs Xk)->((R Xk) x5)))
% Found (x40 x7) as proof of ((R Xy) x5)
% Found ((x4 x5) x7) as proof of ((R Xy) x5)
% Found ((x4 x5) x7) as proof of ((R Xy) x5)
% Found ((x4 x5) x7) as proof of ((R Xy) x5)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x6 as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x7:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))
% Instantiate: x1:=(U Xs):a
% Found x7 as proof of (forall (Xk:a), ((Xs Xk)->((R Xk) x1)))
% Found (x50 x7) as proof of ((R Xy) x1)
% Found ((x5 x1) x7) as proof of ((R Xy) x1)
% Found ((x5 x1) x7) as proof of ((R Xy) x1)
% Found ((x5 x1) x7) as proof of ((R Xy) x1)
% Found x7:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))
% Instantiate: Xy:=(U Xs):a
% Found x7 as proof of (forall (Xk:a), ((Xs Xk)->((R Xk) Xy)))
% Found (x50 x7) as proof of ((R x1) Xy)
% Found ((x5 Xy) x7) as proof of ((R x1) Xy)
% Found ((x5 Xy) x7) as proof of ((R x1) Xy)
% Found ((x5 Xy) x7) as proof of ((R x1) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);x3:=Xk:a
% Found (fun (x6:(Xs Xk))=> x6) as proof of ((R Xk) x3)
% Found x6:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found (fun (x6:(Xs Xk))=> x6) as proof of ((R Xk) Xy)
% Found x8:(Xs Xk)
% Instantiate: Xs:=(R Xk):(a->Prop);Xy:=Xk:a
% Found x8 as proof of ((R Xk) Xy)
% Found x50:=(x5 (U Xs)):((forall (Xk:a), ((Xs Xk)->((R Xk) (U Xs))))->((R (U Xs)) (U Xs)))
% Found (x5 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x3))
% Found (x5 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x3))
% Found (x5 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x3))
% Found (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs))) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x3))
% Found (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs))) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x3)))
% Found (and_rect20 (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs)))) as proof of ((R Xy) x3)
% Found ((and_rect2 ((R Xy) x3)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs)))) as proof of ((R Xy) x3)
% Found (((fun (P:Type) (x6:((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->P)))=> (((((and_rect (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) P) x6) x4)) ((R Xy) x3)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs)))) as proof of ((R Xy) x3)
% Found (((fun (P:Type) (x6:((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->P)))=> (((((and_rect (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) P) x6) x4)) ((R Xy) x3)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs)))) as proof of ((R Xy) x3)
% Found x40:=(x4 (U Xs)):((forall (Xk:a), ((Xs Xk)->((R Xk) (U Xs))))->((R (U Xs)) (U Xs)))
% Found (x4 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x5))
% Found (x4 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x5))
% Found (x4 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x5))
% Found (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x4 (U Xs))) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x5))
% Found (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x4 (U Xs))) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R Xy) x5)))
% Found (and_rect20 (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x4 (U Xs)))) as proof of ((R Xy) x5)
% Found ((and_rect2 ((R Xy) x5)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x4 (U Xs)))) as proof of ((R Xy) x5)
% Found (((fun (P:Type) (x6:((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->P)))=> (((((and_rect (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) P) x6) x3)) ((R Xy) x5)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x4 (U Xs)))) as proof of ((R Xy) x5)
% Found (((fun (P:Type) (x6:((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->P)))=> (((((and_rect (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) P) x6) x3)) ((R Xy) x5)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x4 (U Xs)))) as proof of ((R Xy) x5)
% Found x50:=(x5 (U Xs)):((forall (Xk:a), ((Xs Xk)->((R Xk) (U Xs))))->((R (U Xs)) (U Xs)))
% Found (x5 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R x3) Xy))
% Found (x5 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R x3) Xy))
% Found (x5 (U Xs)) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R x3) Xy))
% Found (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs))) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R x3) Xy))
% Found (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs))) as proof of ((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((R x3) Xy)))
% Found (and_rect20 (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs)))) as proof of ((R x3) Xy)
% Found ((and_rect2 ((R x3) Xy)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs)))) as proof of ((R x3) Xy)
% Found (((fun (P:Type) (x6:((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->P)))=> (((((and_rect (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) P) x6) x4)) ((R x3) Xy)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs)))))=> (x5 (U Xs)))) as proof of ((R x3) Xy)
% Found (((fun (P:Type) (x6:((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->((forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))->P)))=> (((((and_rect (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) (forall (Xz:a), ((Xs Xz)->((R Xz) (U Xs))))) P) x6) x4)) ((R x3) Xy)) (fun (x6:(forall (Xz:a), ((Xs Xz)->((R Xz) (
% EOF
%------------------------------------------------------------------------------