↑ Up

cocATP---0.2.0.THM-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU571^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n189.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:45:56 CDT 2014
% % CPUTime  : 0.38 
% 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 0xfc17e8>, <kernel.DependentProduct object at 0xfc1dd0>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x119f098>, <kernel.DependentProduct object at 0xfc1dd0>) of role type named setadjoin_type
% Using role type
% Declaring setadjoin:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0xfc1680>, <kernel.Sort object at 0xea7a28>) of role type named setadjoinIR_type
% Using role type
% Declaring setadjoinIR:Prop
% FOF formula (((eq Prop) setadjoinIR) (forall (Xx:fofType) (A:fofType) (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A))))) of role definition named setadjoinIR
% A new definition: (((eq Prop) setadjoinIR) (forall (Xx:fofType) (A:fofType) (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A)))))
% Defined: setadjoinIR:=(forall (Xx:fofType) (A:fofType) (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A))))
% FOF formula (<kernel.Constant object at 0xfc1a70>, <kernel.DependentProduct object at 0xfc1c20>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0xfc1950>, <kernel.Sort object at 0xea7a28>) of role type named subsetI1_type
% Using role type
% Declaring subsetI1:Prop
% FOF formula (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI1
% A new definition: (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))))
% Defined: subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))
% FOF formula (setadjoinIR->(subsetI1->(forall (Xx:fofType) (A:fofType), ((subset A) ((setadjoin Xx) A))))) of role conjecture named setadjoinSub
% Conjecture to prove = (setadjoinIR->(subsetI1->(forall (Xx:fofType) (A:fofType), ((subset A) ((setadjoin Xx) A))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(setadjoinIR->(subsetI1->(forall (Xx:fofType) (A:fofType), ((subset A) ((setadjoin Xx) A)))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter setadjoin:(fofType->(fofType->fofType)).
% Definition setadjoinIR:=(forall (Xx:fofType) (A:fofType) (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A)))):Prop.
% Parameter subset:(fofType->(fofType->Prop)).
% Definition subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop.
% Trying to prove (setadjoinIR->(subsetI1->(forall (Xx:fofType) (A:fofType), ((subset A) ((setadjoin Xx) A)))))
% Found x10:=(x1 A):(forall (Xy:fofType), (((in Xy) A)->((in Xy) ((setadjoin Xx) A))))
% Found (x1 A) as proof of (forall (Xx0:fofType), (((in Xx0) A)->((in Xx0) ((setadjoin Xx) A))))
% Found ((x Xx) A) as proof of (forall (Xx0:fofType), (((in Xx0) A)->((in Xx0) ((setadjoin Xx) A))))
% Found ((x Xx) A) as proof of (forall (Xx0:fofType), (((in Xx0) A)->((in Xx0) ((setadjoin Xx) A))))
% Found (x000 ((x Xx) A)) as proof of ((subset A) ((setadjoin Xx) A))
% Found ((x00 ((setadjoin Xx) A)) ((x Xx) A)) as proof of ((subset A) ((setadjoin Xx) A))
% Found (((x0 A) ((setadjoin Xx) A)) ((x Xx) A)) as proof of ((subset A) ((setadjoin Xx) A))
% Found (fun (A:fofType)=> (((x0 A) ((setadjoin Xx) A)) ((x Xx) A))) as proof of ((subset A) ((setadjoin Xx) A))
% Found (fun (Xx:fofType) (A:fofType)=> (((x0 A) ((setadjoin Xx) A)) ((x Xx) A))) as proof of (forall (A:fofType), ((subset A) ((setadjoin Xx) A)))
% Found (fun (x0:subsetI1) (Xx:fofType) (A:fofType)=> (((x0 A) ((setadjoin Xx) A)) ((x Xx) A))) as proof of (forall (Xx:fofType) (A:fofType), ((subset A) ((setadjoin Xx) A)))
% Found (fun (x:setadjoinIR) (x0:subsetI1) (Xx:fofType) (A:fofType)=> (((x0 A) ((setadjoin Xx) A)) ((x Xx) A))) as proof of (subsetI1->(forall (Xx:fofType) (A:fofType), ((subset A) ((setadjoin Xx) A))))
% Found (fun (x:setadjoinIR) (x0:subsetI1) (Xx:fofType) (A:fofType)=> (((x0 A) ((setadjoin Xx) A)) ((x Xx) A))) as proof of (setadjoinIR->(subsetI1->(forall (Xx:fofType) (A:fofType), ((subset A) ((setadjoin Xx) A)))))
% Got proof (fun (x:setadjoinIR) (x0:subsetI1) (Xx:fofType) (A:fofType)=> (((x0 A) ((setadjoin Xx) A)) ((x Xx) A)))
% Time elapsed = 0.059685s
% node=11 cost=-108.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:setadjoinIR) (x0:subsetI1) (Xx:fofType) (A:fofType)=> (((x0 A) ((setadjoin Xx) A)) ((x Xx) A)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------