↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem Process solution in
SystemOnTSTP Download .tgz 
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU508^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 : n092.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:19 EDT 2014

% Result   : Theorem 0.56s
% Output   : Proof 0.56s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU508^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n092.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:26:41 CDT 2014
% % CPUTime  : 0.56 
% 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 0x2196170>, <kernel.DependentProduct object at 0x2196878>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1f274d0>, <kernel.DependentProduct object at 0x21967a0>) of role type named dsetconstr_type
% Using role type
% Declaring dsetconstr:(fofType->((fofType->Prop)->fofType))
% FOF formula (<kernel.Constant object at 0x2196758>, <kernel.Sort object at 0x1ff8b48>) 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 0x1c2ac68>, <kernel.Sort object at 0x1ff8b48>) of role type named dsetconstrER_type
% Using role type
% Declaring dsetconstrER:Prop
% FOF formula (((eq Prop) dsetconstrER) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx)))) of role definition named dsetconstrER
% A new definition: (((eq Prop) dsetconstrER) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))))
% Defined: dsetconstrER:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx)))
% FOF formula (dsetconstrI->(dsetconstrER->(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx)))))) of role conjecture named setbeta
% Conjecture to prove = (dsetconstrI->(dsetconstrER->(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx)))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(dsetconstrI->(dsetconstrER->(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx))))))']
% 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 dsetconstrER:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))):Prop.
% Trying to prove (dsetconstrI->(dsetconstrER->(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx))))))
% Found x0000:=(x000 Xx):(((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))
% Found (x000 Xx) as proof of (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))
% Found ((x00 Xphi) Xx) as proof of (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))
% Found (((x0 A) Xphi) Xx) as proof of (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))
% Found (((x0 A) Xphi) Xx) as proof of (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))
% Found x2000:=(x200 x1):((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))
% Found (x200 x1) as proof of ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))
% Found ((x20 Xx) x1) as proof of ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))
% Found (((x2 Xphi) Xx) x1) as proof of ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))
% Found ((((x A) Xphi) Xx) x1) as proof of ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))
% Found ((((x A) Xphi) Xx) x1) as proof of ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))
% Found ((conj00 (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1)) as proof of ((and (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))
% Found (((conj0 ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1)) as proof of ((and (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))
% Found ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1)) as proof of ((and (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))
% Found ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1)) as proof of ((and (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))
% Found (fun (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1))) as proof of ((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx))
% Found (fun (Xx:fofType) (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1))) as proof of (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx)))
% Found (fun (Xphi:(fofType->Prop)) (Xx:fofType) (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1))) as proof of (forall (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx))))
% Found (fun (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType) (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1))) as proof of (forall (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx))))
% Found (fun (x0:dsetconstrER) (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType) (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1))) as proof of (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx))))
% Found (fun (x:dsetconstrI) (x0:dsetconstrER) (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType) (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1))) as proof of (dsetconstrER->(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx)))))
% Found (fun (x:dsetconstrI) (x0:dsetconstrER) (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType) (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1))) as proof of (dsetconstrI->(dsetconstrER->(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((iff ((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))) (Xphi Xx))))))
% Got proof (fun (x:dsetconstrI) (x0:dsetconstrER) (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType) (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1)))
% Time elapsed = 0.239912s
% node=40 cost=1860.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:dsetconstrER) (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType) (x1:((in Xx) A))=> ((((conj (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))) ((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))) (((x0 A) Xphi) Xx)) ((((x A) Xphi) Xx) x1)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------