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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU569^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 : n183.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.34s
% Output   : Proof 0.34s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU569^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n183.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:21 CDT 2014
% % CPUTime  : 0.34 
% 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 0x1b2c830>, <kernel.DependentProduct object at 0x1b2c128>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1b2e830>, <kernel.DependentProduct object at 0x1b2c128>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1b2ce60>, <kernel.Sort object at 0x1987878>) of role type named subsetI2_type
% Using role type
% Declaring subsetI2:Prop
% FOF formula (((eq Prop) subsetI2) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI2
% A new definition: (((eq Prop) subsetI2) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))))
% Defined: subsetI2:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))
% FOF formula (subsetI2->(forall (A:fofType), ((subset A) A))) of role conjecture named subsetRefl
% Conjecture to prove = (subsetI2->(forall (A:fofType), ((subset A) A))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(subsetI2->(forall (A:fofType), ((subset A) A)))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter subset:(fofType->(fofType->Prop)).
% Definition subsetI2:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop.
% Trying to prove (subsetI2->(forall (A:fofType), ((subset A) A)))
% Found x1:((in Xx) A)
% Found (fun (x1:((in Xx) A))=> x1) as proof of ((in Xx) A)
% Found (fun (Xx:fofType) (x1:((in Xx) A))=> x1) as proof of (((in Xx) A)->((in Xx) A))
% Found (fun (Xx:fofType) (x1:((in Xx) A))=> x1) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) A)))
% Found (x00 (fun (Xx:fofType) (x1:((in Xx) A))=> x1)) as proof of ((subset A) A)
% Found ((x0 A) (fun (Xx:fofType) (x1:((in Xx) A))=> x1)) as proof of ((subset A) A)
% Found (((x A) A) (fun (Xx:fofType) (x1:((in Xx) A))=> x1)) as proof of ((subset A) A)
% Found (fun (A:fofType)=> (((x A) A) (fun (Xx:fofType) (x1:((in Xx) A))=> x1))) as proof of ((subset A) A)
% Found (fun (x:subsetI2) (A:fofType)=> (((x A) A) (fun (Xx:fofType) (x1:((in Xx) A))=> x1))) as proof of (forall (A:fofType), ((subset A) A))
% Found (fun (x:subsetI2) (A:fofType)=> (((x A) A) (fun (Xx:fofType) (x1:((in Xx) A))=> x1))) as proof of (subsetI2->(forall (A:fofType), ((subset A) A)))
% Got proof (fun (x:subsetI2) (A:fofType)=> (((x A) A) (fun (Xx:fofType) (x1:((in Xx) A))=> x1)))
% Time elapsed = 0.028143s
% node=8 cost=70.000000 depth=8
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:subsetI2) (A:fofType)=> (((x A) A) (fun (Xx:fofType) (x1:((in Xx) A))=> x1)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------