TSTP Solution File: SEU777^2 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU777^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 : n108.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:05 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU777^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n108.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:26:56 CDT 2014
% % CPUTime  : 0.51 
% 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 0x22acdd0>, <kernel.DependentProduct object at 0x22ac518>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x246f560>, <kernel.DependentProduct object at 0x22ac518>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x22ac368>, <kernel.DependentProduct object at 0x22acdd0>) of role type named kpair_type
% Using role type
% Declaring kpair:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x22acb90>, <kernel.DependentProduct object at 0x26e61b8>) of role type named cartprod_type
% Using role type
% Declaring cartprod:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x22ac518>, <kernel.DependentProduct object at 0x22ac368>) of role type named breln_type
% Using role type
% Declaring breln:(fofType->(fofType->(fofType->Prop)))
% FOF formula (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))) of role definition named breln
% A new definition: (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))))
% Defined: breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))
% FOF formula (<kernel.Constant object at 0x26e6b90>, <kernel.DependentProduct object at 0x22acfc8>) of role type named dpsetconstr_type
% Using role type
% Declaring dpsetconstr:(fofType->(fofType->((fofType->(fofType->Prop))->fofType)))
% FOF formula (<kernel.Constant object at 0x26e6878>, <kernel.Sort object at 0x2177128>) of role type named dpsetconstrER_type
% Using role type
% Declaring dpsetconstrER:Prop
% FOF formula (((eq Prop) dpsetconstrER) (forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))) (Xx:fofType) (Xy:fofType), (((in ((kpair Xx) Xy)) (((dpsetconstr A) B) (fun (Xz:fofType) (Xu:fofType)=> ((Xphi Xz) Xu))))->((Xphi Xx) Xy)))) of role definition named dpsetconstrER
% A new definition: (((eq Prop) dpsetconstrER) (forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))) (Xx:fofType) (Xy:fofType), (((in ((kpair Xx) Xy)) (((dpsetconstr A) B) (fun (Xz:fofType) (Xu:fofType)=> ((Xphi Xz) Xu))))->((Xphi Xx) Xy))))
% Defined: dpsetconstrER:=(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))) (Xx:fofType) (Xy:fofType), (((in ((kpair Xx) Xy)) (((dpsetconstr A) B) (fun (Xz:fofType) (Xu:fofType)=> ((Xphi Xz) Xu))))->((Xphi Xx) Xy)))
% FOF formula (<kernel.Constant object at 0x26e6878>, <kernel.DependentProduct object at 0x22ac368>) of role type named breln1_type
% Using role type
% Declaring breln1:(fofType->(fofType->Prop))
% FOF formula (((eq (fofType->(fofType->Prop))) breln1) (fun (A:fofType) (R:fofType)=> (((breln A) A) R))) of role definition named breln1
% A new definition: (((eq (fofType->(fofType->Prop))) breln1) (fun (A:fofType) (R:fofType)=> (((breln A) A) R)))
% Defined: breln1:=(fun (A:fofType) (R:fofType)=> (((breln A) A) R))
% FOF formula (<kernel.Constant object at 0x26e6098>, <kernel.DependentProduct object at 0x22acc68>) of role type named breln1invset_type
% Using role type
% Declaring breln1invset:(fofType->(fofType->fofType))
% FOF formula (((eq (fofType->(fofType->fofType))) breln1invset) (fun (A:fofType) (R:fofType)=> (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((in ((kpair Xy) Xx)) R))))) of role definition named breln1invset
% A new definition: (((eq (fofType->(fofType->fofType))) breln1invset) (fun (A:fofType) (R:fofType)=> (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((in ((kpair Xy) Xx)) R)))))
% Defined: breln1invset:=(fun (A:fofType) (R:fofType)=> (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((in ((kpair Xy) Xx)) R))))
% FOF formula (dpsetconstrER->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))))))))) of role conjecture named breln1invE
% Conjecture to prove = (dpsetconstrER->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(dpsetconstrER->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R)))))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter subset:(fofType->(fofType->Prop)).
% Parameter kpair:(fofType->(fofType->fofType)).
% Parameter cartprod:(fofType->(fofType->fofType)).
% Definition breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))):(fofType->(fofType->(fofType->Prop))).
% Parameter dpsetconstr:(fofType->(fofType->((fofType->(fofType->Prop))->fofType))).
% Definition dpsetconstrER:=(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))) (Xx:fofType) (Xy:fofType), (((in ((kpair Xx) Xy)) (((dpsetconstr A) B) (fun (Xz:fofType) (Xu:fofType)=> ((Xphi Xz) Xu))))->((Xphi Xx) Xy))):Prop.
% Definition breln1:=(fun (A:fofType) (R:fofType)=> (((breln A) A) R)):(fofType->(fofType->Prop)).
% Definition breln1invset:=(fun (A:fofType) (R:fofType)=> (((dpsetconstr A) A) (fun (Xx:fofType) (Xy:fofType)=> ((in ((kpair Xy) Xx)) R)))):(fofType->(fofType->fofType)).
% Trying to prove (dpsetconstrER->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R)))))))))
% Found x30000:=(x3000 Xx):(((in ((kpair Xy) Xx)) (((dpsetconstr A) A) (fun (Xz:fofType) (Xu:fofType)=> ((in ((kpair Xu) Xz)) R))))->((in ((kpair Xx) Xy)) R))
% Found (x3000 Xx) as proof of (((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))
% Found ((x300 Xy) Xx) as proof of (((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))
% Found (((x30 (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx) as proof of (((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))
% Found ((((x3 A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx) as proof of (((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))
% Found (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx) as proof of (((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))
% Found (fun (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))
% Found (fun (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R)))
% Found (fun (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))))
% Found (fun (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R)))))
% Found (fun (x0:((breln1 A) R)) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))))))
% Found (fun (R:fofType) (x0:((breln1 A) R)) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (((breln1 A) R)->(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R)))))))
% Found (fun (A:fofType) (R:fofType) (x0:((breln1 A) R)) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (forall (R:fofType), (((breln1 A) R)->(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))))))))
% Found (fun (x:dpsetconstrER) (A:fofType) (R:fofType) (x0:((breln1 A) R)) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R))))))))
% Found (fun (x:dpsetconstrER) (A:fofType) (R:fofType) (x0:((breln1 A) R)) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx)) as proof of (dpsetconstrER->(forall (A:fofType) (R:fofType), (((breln1 A) R)->(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) A)->(((in ((kpair Xy) Xx)) ((breln1invset A) R))->((in ((kpair Xx) Xy)) R)))))))))
% Got proof (fun (x:dpsetconstrER) (A:fofType) (R:fofType) (x0:((breln1 A) R)) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx))
% Time elapsed = 0.167046s
% node=15 cost=-394.000000 depth=13
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:dpsetconstrER) (A:fofType) (R:fofType) (x0:((breln1 A) R)) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) A))=> (((((x A) A) (fun (x7:fofType) (x60:fofType)=> ((in ((kpair x60) x7)) R))) Xy) Xx))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------