TSTP Solution File: SEU517^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU517^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 : n100.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:21 EDT 2014
% Result : Theorem 0.84s
% Output : Proof 0.84s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU517^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n100.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:28:46 CDT 2014
% % CPUTime : 0.84
% 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 0x12c65a8>, <kernel.DependentProduct object at 0x16832d8>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x12c6bd8>, <kernel.DependentProduct object at 0x16830e0>) of role type named dsetconstr_type
% Using role type
% Declaring dsetconstr:(fofType->((fofType->Prop)->fofType))
% FOF formula (<kernel.Constant object at 0x12c6710>, <kernel.Sort object at 0x1190ea8>) of role type named dsetconstrI_type
% Using role type
% Declaring dsetconstrI:Prop
% FOF formula (((eq Prop) dsetconstrI) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))))) of role definition named dsetconstrI
% A new definition: (((eq Prop) dsetconstrI) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))))
% Defined: dsetconstrI:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))))
% FOF formula (<kernel.Constant object at 0x12c6710>, <kernel.Sort object at 0x1190ea8>) of role type named dsetconstrEL_type
% Using role type
% Declaring dsetconstrEL:Prop
% FOF formula (((eq Prop) dsetconstrEL) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A)))) of role definition named dsetconstrEL
% A new definition: (((eq Prop) dsetconstrEL) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A))))
% Defined: dsetconstrEL:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A)))
% FOF formula (<kernel.Constant object at 0x12c65a8>, <kernel.Sort object at 0x1190ea8>) of role type named setext_type
% Using role type
% Declaring setext:Prop
% FOF formula (((eq Prop) setext) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B))))) of role definition named setext
% A new definition: (((eq Prop) setext) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B)))))
% Defined: setext:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B))))
% FOF formula (dsetconstrI->(dsetconstrEL->(setext->(forall (A:fofType), (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A))))) of role conjecture named setoftrueEq
% Conjecture to prove = (dsetconstrI->(dsetconstrEL->(setext->(forall (A:fofType), (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(dsetconstrI->(dsetconstrEL->(setext->(forall (A:fofType), (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A)))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)).
% Definition dsetconstrI:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))):Prop.
% Definition dsetconstrEL:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A))):Prop.
% Definition setext:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B)))):Prop.
% Trying to prove (dsetconstrI->(dsetconstrEL->(setext->(forall (A:fofType), (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A)))))
% Found x000:=(x00 (fun (x4:fofType)=> True)):(forall (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> True)))->((in Xx) A)))
% Found (x00 (fun (x4:fofType)=> True)) as proof of (forall (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))->((in Xx) A)))
% Found ((x0 A) (fun (x4:fofType)=> True)) as proof of (forall (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))->((in Xx) A)))
% Found ((x0 A) (fun (x4:fofType)=> True)) as proof of (forall (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))->((in Xx) A)))
% Found x30000:=(x3000 x2):((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> True)))
% Found (x3000 x2) as proof of ((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))
% Found ((x300 Xx) x2) as proof of ((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))
% Found (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((x30 Xx0) x4) I)) Xx) x2) as proof of ((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))
% Found (((fun (Xx0:fofType) (x4:((in Xx0) A))=> ((((x3 (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2) as proof of ((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))
% Found (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2) as proof of ((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))
% Found (fun (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2)) as proof of ((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))
% Found (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2)) as proof of (((in Xx) A)->((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True))))
% Found (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2)) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) ((dsetconstr A) (fun (Xx:fofType)=> True)))))
% Found ((x100 ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2))) as proof of (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A)
% Found (((x10 A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2))) as proof of (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A)
% Found ((((x1 ((dsetconstr A) (fun (Xx:fofType)=> True))) A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2))) as proof of (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A)
% Found (fun (A:fofType)=> ((((x1 ((dsetconstr A) (fun (Xx:fofType)=> True))) A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2)))) as proof of (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A)
% Found (fun (x1:setext) (A:fofType)=> ((((x1 ((dsetconstr A) (fun (Xx:fofType)=> True))) A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2)))) as proof of (forall (A:fofType), (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A))
% Found (fun (x0:dsetconstrEL) (x1:setext) (A:fofType)=> ((((x1 ((dsetconstr A) (fun (Xx:fofType)=> True))) A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2)))) as proof of (setext->(forall (A:fofType), (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A)))
% Found (fun (x:dsetconstrI) (x0:dsetconstrEL) (x1:setext) (A:fofType)=> ((((x1 ((dsetconstr A) (fun (Xx:fofType)=> True))) A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2)))) as proof of (dsetconstrEL->(setext->(forall (A:fofType), (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A))))
% Found (fun (x:dsetconstrI) (x0:dsetconstrEL) (x1:setext) (A:fofType)=> ((((x1 ((dsetconstr A) (fun (Xx:fofType)=> True))) A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2)))) as proof of (dsetconstrI->(dsetconstrEL->(setext->(forall (A:fofType), (((eq fofType) ((dsetconstr A) (fun (Xx:fofType)=> True))) A)))))
% Got proof (fun (x:dsetconstrI) (x0:dsetconstrEL) (x1:setext) (A:fofType)=> ((((x1 ((dsetconstr A) (fun (Xx:fofType)=> True))) A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2))))
% Time elapsed = 0.515515s
% node=79 cost=234.000000 depth=15
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:dsetconstrI) (x0:dsetconstrEL) (x1:setext) (A:fofType)=> ((((x1 ((dsetconstr A) (fun (Xx:fofType)=> True))) A) ((x0 A) (fun (x4:fofType)=> True))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((fun (Xx0:fofType) (x4:((in Xx0) A))=> (((((x A) (fun (x7:fofType)=> True)) Xx0) x4) I)) Xx) x2))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------