TSTP Solution File: SEU798^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU798^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 : 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:33:09 EDT 2014
% Result : Theorem 0.40s
% Output : Proof 0.40s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU798^2 : TPTP v6.1.0. Released v3.7.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 11:30:51 CDT 2014
% % CPUTime : 0.40
% 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 0x1be5908>, <kernel.DependentProduct object at 0x1be5830>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x20166c8>, <kernel.DependentProduct object at 0x1be5e18>) of role type named dsetconstr_type
% Using role type
% Declaring dsetconstr:(fofType->((fofType->Prop)->fofType))
% FOF formula (<kernel.Constant object at 0x1be5638>, <kernel.Sort object at 0x1e78b48>) 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 0x1be57e8>, <kernel.DependentProduct object at 0x1be5998>) of role type named funcSet_type
% Using role type
% Declaring funcSet:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x1be55a8>, <kernel.DependentProduct object at 0x1be5908>) of role type named injective_type
% Using role type
% Declaring injective:(fofType->(fofType->(fofType->Prop)))
% FOF formula (<kernel.Constant object at 0x1be5638>, <kernel.DependentProduct object at 0x1be57e8>) of role type named injFuncSet_type
% Using role type
% Declaring injFuncSet:(fofType->(fofType->fofType))
% FOF formula (((eq (fofType->(fofType->fofType))) injFuncSet) (fun (A:fofType) (B:fofType)=> ((dsetconstr ((funcSet A) B)) (fun (Xf:fofType)=> (((injective A) B) Xf))))) of role definition named injFuncSet
% A new definition: (((eq (fofType->(fofType->fofType))) injFuncSet) (fun (A:fofType) (B:fofType)=> ((dsetconstr ((funcSet A) B)) (fun (Xf:fofType)=> (((injective A) B) Xf)))))
% Defined: injFuncSet:=(fun (A:fofType) (B:fofType)=> ((dsetconstr ((funcSet A) B)) (fun (Xf:fofType)=> (((injective A) B) Xf))))
% FOF formula (dsetconstrI->(forall (A:fofType) (B:fofType) (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B)))))) of role conjecture named injFuncInInjFuncSet
% Conjecture to prove = (dsetconstrI->(forall (A:fofType) (B:fofType) (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B)))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(dsetconstrI->(forall (A:fofType) (B:fofType) (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B))))))']
% 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.
% Parameter funcSet:(fofType->(fofType->fofType)).
% Parameter injective:(fofType->(fofType->(fofType->Prop))).
% Definition injFuncSet:=(fun (A:fofType) (B:fofType)=> ((dsetconstr ((funcSet A) B)) (fun (Xf:fofType)=> (((injective A) B) Xf)))):(fofType->(fofType->fofType)).
% Trying to prove (dsetconstrI->(forall (A:fofType) (B:fofType) (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B))))))
% Found x00:=(x0 ((injective A) B)):(forall (Xx:fofType), (((in Xx) ((funcSet A) B))->((((injective A) B) Xx)->((in Xx) ((dsetconstr ((funcSet A) B)) (fun (Xy:fofType)=> (((injective A) B) Xy)))))))
% Found (x0 ((injective A) B)) as proof of (forall (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B)))))
% Found ((x ((funcSet A) B)) ((injective A) B)) as proof of (forall (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B)))))
% Found (fun (B:fofType)=> ((x ((funcSet A) B)) ((injective A) B))) as proof of (forall (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B)))))
% Found (fun (A:fofType) (B:fofType)=> ((x ((funcSet A) B)) ((injective A) B))) as proof of (forall (B:fofType) (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B)))))
% Found (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x ((funcSet A) B)) ((injective A) B))) as proof of (forall (A:fofType) (B:fofType) (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B)))))
% Found (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x ((funcSet A) B)) ((injective A) B))) as proof of (dsetconstrI->(forall (A:fofType) (B:fofType) (Xf:fofType), (((in Xf) ((funcSet A) B))->((((injective A) B) Xf)->((in Xf) ((injFuncSet A) B))))))
% Got proof (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x ((funcSet A) B)) ((injective A) B)))
% Time elapsed = 0.081232s
% node=6 cost=-179.000000 depth=5
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x ((funcSet A) B)) ((injective A) B)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------