↑ Up

cocATP---0.2.0.THM-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU662^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n095.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:05:11 CDT 2014
% % CPUTime  : 0.57 
% 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 0x1143cb0>, <kernel.DependentProduct object at 0x1143ea8>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1574e60>, <kernel.DependentProduct object at 0x1143ea8>) of role type named kpair_type
% Using role type
% Declaring kpair:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x11437e8>, <kernel.DependentProduct object at 0x11439e0>) of role type named kfst_type
% Using role type
% Declaring kfst:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x1143878>, <kernel.Sort object at 0x13d6878>) of role type named kfstpairEq_type
% Using role type
% Declaring kfstpairEq:Prop
% FOF formula (((eq Prop) kfstpairEq) (forall (Xx:fofType) (Xy:fofType), (((eq fofType) (kfst ((kpair Xx) Xy))) Xx))) of role definition named kfstpairEq
% A new definition: (((eq Prop) kfstpairEq) (forall (Xx:fofType) (Xy:fofType), (((eq fofType) (kfst ((kpair Xx) Xy))) Xx)))
% Defined: kfstpairEq:=(forall (Xx:fofType) (Xy:fofType), (((eq fofType) (kfst ((kpair Xx) Xy))) Xx))
% FOF formula (<kernel.Constant object at 0x1143680>, <kernel.Sort object at 0x13d6878>) of role type named cartprodmempaircEq_type
% Using role type
% Declaring cartprodmempaircEq:Prop
% FOF formula (((eq Prop) cartprodmempaircEq) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy))))))) of role definition named cartprodmempaircEq
% A new definition: (((eq Prop) cartprodmempaircEq) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))))))
% Defined: cartprodmempaircEq:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy))))))
% FOF formula (kfstpairEq->(cartprodmempaircEq->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx))))))) of role conjecture named cartprodfstpairEq
% Conjecture to prove = (kfstpairEq->(cartprodmempaircEq->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(kfstpairEq->(cartprodmempaircEq->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx)))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter kpair:(fofType->(fofType->fofType)).
% Parameter kfst:(fofType->fofType).
% Definition kfstpairEq:=(forall (Xx:fofType) (Xy:fofType), (((eq fofType) (kfst ((kpair Xx) Xy))) Xx)):Prop.
% Definition cartprodmempaircEq:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))))):Prop.
% Trying to prove (kfstpairEq->(cartprodmempaircEq->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx)))))))
% Found x30:=(x3 Xy):(((eq fofType) (kfst ((kpair Xx) Xy))) Xx)
% Found (x3 Xy) as proof of (((eq fofType) (kfst ((kpair Xx) Xy))) Xx)
% Found ((x Xx) Xy) as proof of (((eq fofType) (kfst ((kpair Xx) Xy))) Xx)
% Found (fun (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (((eq fofType) (kfst ((kpair Xx) Xy))) Xx)
% Found (fun (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx))
% Found (fun (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx)))
% Found (fun (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx))))
% Found (fun (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx)))))
% Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (forall (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx)))))
% Found (fun (x0:cartprodmempaircEq) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx)))))
% Found (fun (x:kfstpairEq) (x0:cartprodmempaircEq) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (cartprodmempaircEq->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx))))))
% Found (fun (x:kfstpairEq) (x0:cartprodmempaircEq) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy)) as proof of (kfstpairEq->(cartprodmempaircEq->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) (kfst ((kpair Xx) Xy))) Xx)))))))
% Got proof (fun (x:kfstpairEq) (x0:cartprodmempaircEq) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy))
% Time elapsed = 0.252652s
% node=16 cost=-129.000000 depth=10
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:kfstpairEq) (x0:cartprodmempaircEq) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (Xy:fofType) (x2:((in Xy) B))=> ((x Xx) Xy))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------