TSTP Solution File: SEU576^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU576^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 : n099.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:30 EDT 2014
% Result : Theorem 0.41s
% Output : Proof 0.41s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU576^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n099.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:47:01 CDT 2014
% % CPUTime : 0.41
% 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 0xef01b8>, <kernel.DependentProduct object at 0xef0560>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0xdc6bd8>, <kernel.DependentProduct object at 0xef05f0>) of role type named powerset_type
% Using role type
% Declaring powerset:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0xef08c0>, <kernel.Sort object at 0x9fb488>) of role type named powersetI_type
% Using role type
% Declaring powersetI:Prop
% FOF formula (((eq Prop) powersetI) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A))))) of role definition named powersetI
% A new definition: (((eq Prop) powersetI) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))))
% Defined: powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A))))
% FOF formula (<kernel.Constant object at 0xef0128>, <kernel.DependentProduct object at 0xef0098>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0xef01b8>, <kernel.Sort object at 0x9fb488>) of role type named subsetE_type
% Using role type
% Declaring subsetE:Prop
% FOF formula (((eq Prop) subsetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B))))) of role definition named subsetE
% A new definition: (((eq Prop) subsetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))))
% Defined: subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B))))
% FOF formula (powersetI->(subsetE->(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A)))))) of role conjecture named powersetI1
% Conjecture to prove = (powersetI->(subsetE->(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A)))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(powersetI->(subsetE->(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter powerset:(fofType->fofType).
% Definition powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))):Prop.
% Parameter subset:(fofType->(fofType->Prop)).
% Definition subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))):Prop.
% Trying to prove (powersetI->(subsetE->(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A))))))
% Found x00000:=(x0000 Xx):(((in Xx) B)->((in Xx) A))
% Found (x0000 Xx) as proof of (((in Xx) B)->((in Xx) A))
% Found ((fun (Xx0:fofType)=> ((x000 Xx0) x1)) Xx) as proof of (((in Xx) B)->((in Xx) A))
% Found ((fun (Xx0:fofType)=> (((x00 A) Xx0) x1)) Xx) as proof of (((in Xx) B)->((in Xx) A))
% Found ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx) as proof of (((in Xx) B)->((in Xx) A))
% Found (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx)) as proof of (((in Xx) B)->((in Xx) A))
% Found (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx)) as proof of (forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))
% Found (x20 (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx))) as proof of ((in B) (powerset A))
% Found ((x2 B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx))) as proof of ((in B) (powerset A))
% Found (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx))) as proof of ((in B) (powerset A))
% Found (fun (x1:((subset B) A))=> (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx)))) as proof of ((in B) (powerset A))
% Found (fun (B:fofType) (x1:((subset B) A))=> (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx)))) as proof of (((subset B) A)->((in B) (powerset A)))
% Found (fun (A:fofType) (B:fofType) (x1:((subset B) A))=> (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx)))) as proof of (forall (B:fofType), (((subset B) A)->((in B) (powerset A))))
% Found (fun (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset B) A))=> (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx)))) as proof of (forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A))))
% Found (fun (x:powersetI) (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset B) A))=> (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx)))) as proof of (subsetE->(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A)))))
% Found (fun (x:powersetI) (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset B) A))=> (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx)))) as proof of (powersetI->(subsetE->(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A))))))
% Got proof (fun (x:powersetI) (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset B) A))=> (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx))))
% Time elapsed = 0.094331s
% node=21 cost=86.000000 depth=14
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:powersetI) (x0:subsetE) (A:fofType) (B:fofType) (x1:((subset B) A))=> (((x A) B) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x0 B) A) Xx0) x1)) Xx))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------