TSTP Solution File: SEU802^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU802^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 : n117.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:10 EDT 2014
% Result : Theorem 0.42s
% Output : Proof 0.42s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU802^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n117.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:31:11 CDT 2014
% % CPUTime : 0.42
% 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 0x1da0cf8>, <kernel.DependentProduct object at 0x1da0ab8>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x215d440>, <kernel.DependentProduct object at 0x1da0bd8>) of role type named dsetconstr_type
% Using role type
% Declaring dsetconstr:(fofType->((fofType->Prop)->fofType))
% FOF formula (<kernel.Constant object at 0x1da0d88>, <kernel.Sort object at 0x1c65368>) 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 (<kernel.Constant object at 0x1da0c68>, <kernel.DependentProduct object at 0x1da0a28>) of role type named funcSet_type
% Using role type
% Declaring funcSet:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x1da0b90>, <kernel.DependentProduct object at 0x1da0cf8>) of role type named ap_type
% Using role type
% Declaring ap:(fofType->(fofType->(fofType->(fofType->fofType))))
% FOF formula (<kernel.Constant object at 0x1da0d88>, <kernel.DependentProduct object at 0x1da0c68>) of role type named surjective_type
% Using role type
% Declaring surjective:(fofType->(fofType->(fofType->Prop)))
% FOF formula (((eq (fofType->(fofType->(fofType->Prop)))) surjective) (fun (A:fofType) (B:fofType) (Xf:fofType)=> (forall (Xx:fofType), (((in Xx) B)->((ex fofType) (fun (Xy:fofType)=> ((and ((in Xy) A)) (((eq fofType) ((((ap A) B) Xf) Xy)) Xx)))))))) of role definition named surjective
% A new definition: (((eq (fofType->(fofType->(fofType->Prop)))) surjective) (fun (A:fofType) (B:fofType) (Xf:fofType)=> (forall (Xx:fofType), (((in Xx) B)->((ex fofType) (fun (Xy:fofType)=> ((and ((in Xy) A)) (((eq fofType) ((((ap A) B) Xf) Xy)) Xx))))))))
% Defined: surjective:=(fun (A:fofType) (B:fofType) (Xf:fofType)=> (forall (Xx:fofType), (((in Xx) B)->((ex fofType) (fun (Xy:fofType)=> ((and ((in Xy) A)) (((eq fofType) ((((ap A) B) Xf) Xy)) Xx)))))))
% FOF formula (<kernel.Constant object at 0x1da0cf8>, <kernel.DependentProduct object at 0x1da0fc8>) of role type named surjFuncSet_type
% Using role type
% Declaring surjFuncSet:(fofType->(fofType->fofType))
% FOF formula (((eq (fofType->(fofType->fofType))) surjFuncSet) (fun (A:fofType) (B:fofType)=> ((dsetconstr ((funcSet A) B)) (fun (Xf:fofType)=> (((surjective A) B) Xf))))) of role definition named surjFuncSet
% A new definition: (((eq (fofType->(fofType->fofType))) surjFuncSet) (fun (A:fofType) (B:fofType)=> ((dsetconstr ((funcSet A) B)) (fun (Xf:fofType)=> (((surjective A) B) Xf)))))
% Defined: surjFuncSet:=(fun (A:fofType) (B:fofType)=> ((dsetconstr ((funcSet A) B)) (fun (Xf:fofType)=> (((surjective A) B) Xf))))
% FOF formula (dsetconstrER->(forall (Xx:fofType) (Xy:fofType) (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf)))) of role conjecture named surjFuncSetFuncSurj
% Conjecture to prove = (dsetconstrER->(forall (Xx:fofType) (Xy:fofType) (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf)))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(dsetconstrER->(forall (Xx:fofType) (Xy:fofType) (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)).
% Definition dsetconstrER:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->(Xphi Xx))):Prop.
% Parameter funcSet:(fofType->(fofType->fofType)).
% Parameter ap:(fofType->(fofType->(fofType->(fofType->fofType)))).
% Definition surjective:=(fun (A:fofType) (B:fofType) (Xf:fofType)=> (forall (Xx:fofType), (((in Xx) B)->((ex fofType) (fun (Xy:fofType)=> ((and ((in Xy) A)) (((eq fofType) ((((ap A) B) Xf) Xy)) Xx))))))):(fofType->(fofType->(fofType->Prop))).
% Definition surjFuncSet:=(fun (A:fofType) (B:fofType)=> ((dsetconstr ((funcSet A) B)) (fun (Xf:fofType)=> (((surjective A) B) Xf)))):(fofType->(fofType->fofType)).
% Trying to prove (dsetconstrER->(forall (Xx:fofType) (Xy:fofType) (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf))))
% Found x00:=(x0 ((surjective Xx) Xy)):(forall (Xx0:fofType), (((in Xx0) ((dsetconstr ((funcSet Xx) Xy)) (fun (Xy0:fofType)=> (((surjective Xx) Xy) Xy0))))->(((surjective Xx) Xy) Xx0)))
% Found (x0 ((surjective Xx) Xy)) as proof of (forall (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf)))
% Found ((x ((funcSet Xx) Xy)) ((surjective Xx) Xy)) as proof of (forall (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf)))
% Found (fun (Xy:fofType)=> ((x ((funcSet Xx) Xy)) ((surjective Xx) Xy))) as proof of (forall (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf)))
% Found (fun (Xx:fofType) (Xy:fofType)=> ((x ((funcSet Xx) Xy)) ((surjective Xx) Xy))) as proof of (forall (Xy:fofType) (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf)))
% Found (fun (x:dsetconstrER) (Xx:fofType) (Xy:fofType)=> ((x ((funcSet Xx) Xy)) ((surjective Xx) Xy))) as proof of (forall (Xx:fofType) (Xy:fofType) (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf)))
% Found (fun (x:dsetconstrER) (Xx:fofType) (Xy:fofType)=> ((x ((funcSet Xx) Xy)) ((surjective Xx) Xy))) as proof of (dsetconstrER->(forall (Xx:fofType) (Xy:fofType) (Xf:fofType), (((in Xf) ((surjFuncSet Xx) Xy))->(((surjective Xx) Xy) Xf))))
% Got proof (fun (x:dsetconstrER) (Xx:fofType) (Xy:fofType)=> ((x ((funcSet Xx) Xy)) ((surjective Xx) Xy)))
% Time elapsed = 0.092531s
% 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:dsetconstrER) (Xx:fofType) (Xy:fofType)=> ((x ((funcSet Xx) Xy)) ((surjective Xx) Xy)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------