TSTP Solution File: SEU563^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU563^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 : n094.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:28 EDT 2014
% Result : Unknown 0.44s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU563^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n094.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:44:16 CDT 2014
% % CPUTime : 0.44
% 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 0x9bba28>, <kernel.DependentProduct object at 0x9bb9e0>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0xd78200>, <kernel.Single object at 0x9bb908>) of role type named emptyset_type
% Using role type
% Declaring emptyset:fofType
% FOF formula (<kernel.Constant object at 0x9bb9e0>, <kernel.Sort object at 0x881f38>) of role type named emptysetimpfalse_type
% Using role type
% Declaring emptysetimpfalse:Prop
% FOF formula (((eq Prop) emptysetimpfalse) (forall (Xx:fofType), (((in Xx) emptyset)->False))) of role definition named emptysetimpfalse
% A new definition: (((eq Prop) emptysetimpfalse) (forall (Xx:fofType), (((in Xx) emptyset)->False)))
% Defined: emptysetimpfalse:=(forall (Xx:fofType), (((in Xx) emptyset)->False))
% FOF formula (<kernel.Constant object at 0x9bb950>, <kernel.DependentProduct object at 0x9bb560>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (((eq (fofType->(fofType->Prop))) subset) (fun (A:fofType) (B:fofType)=> (forall (Xx:fofType), (((in Xx) A)->((in Xx) B))))) of role definition named subset
% A new definition: (((eq (fofType->(fofType->Prop))) subset) (fun (A:fofType) (B:fofType)=> (forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))))
% Defined: subset:=(fun (A:fofType) (B:fofType)=> (forall (Xx:fofType), (((in Xx) A)->((in Xx) B))))
% FOF formula (<kernel.Constant object at 0x9bb560>, <kernel.Sort object at 0x881f38>) 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 (emptysetimpfalse->(subsetI2->(forall (A:fofType), ((subset emptyset) A)))) of role conjecture named emptysetsubset
% Conjecture to prove = (emptysetimpfalse->(subsetI2->(forall (A:fofType), ((subset emptyset) A)))):Prop
% We need to prove ['(emptysetimpfalse->(subsetI2->(forall (A:fofType), ((subset emptyset) A))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter emptyset:fofType.
% Definition emptysetimpfalse:=(forall (Xx:fofType), (((in Xx) emptyset)->False)):Prop.
% Definition subset:=(fun (A:fofType) (B:fofType)=> (forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))):(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 (emptysetimpfalse->(subsetI2->(forall (A:fofType), ((subset emptyset) A))))
% % SZS status GaveUp for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------