TSTP Solution File: SEU565^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU565^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 : n108.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 : Theorem 0.44s
% Output : Proof 0.44s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU565^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n108.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:36 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 0x12efbd8>, <kernel.DependentProduct object at 0x12ef7e8>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1728bd8>, <kernel.DependentProduct object at 0x12ef7e8>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x12efea8>, <kernel.Sort object at 0x11b7d88>) 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 (subsetE->(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False))))) of role conjecture named subsetE2
% Conjecture to prove = (subsetE->(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(subsetE->(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False)))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->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 (subsetE->(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False)))))
% Found x30000:=(x3000 x2):((in Xx) B)
% Found (x3000 x2) as proof of ((in Xx) B)
% Found ((x300 x0) x2) as proof of ((in Xx) B)
% Found (((x30 A) x0) x2) as proof of ((in Xx) B)
% Found ((((fun (A0:fofType)=> ((x3 A0) Xx)) A) x0) x2) as proof of ((in Xx) B)
% Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2) as proof of ((in Xx) B)
% Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2) as proof of ((in Xx) B)
% Found (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2)) as proof of False
% Found (fun (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of False
% Found (fun (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (((in Xx) A)->False)
% Found (fun (x0:((subset A) B)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of ((((in Xx) B)->False)->(((in Xx) A)->False))
% Found (fun (Xx:fofType) (x0:((subset A) B)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False)))
% Found (fun (B:fofType) (Xx:fofType) (x0:((subset A) B)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (forall (Xx:fofType), (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False))))
% Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x0:((subset A) B)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (forall (B:fofType) (Xx:fofType), (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False))))
% Found (fun (x:subsetE) (A:fofType) (B:fofType) (Xx:fofType) (x0:((subset A) B)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False))))
% Found (fun (x:subsetE) (A:fofType) (B:fofType) (Xx:fofType) (x0:((subset A) B)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (subsetE->(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->((((in Xx) B)->False)->(((in Xx) A)->False)))))
% Got proof (fun (x:subsetE) (A:fofType) (B:fofType) (Xx:fofType) (x0:((subset A) B)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2)))
% Time elapsed = 0.121606s
% node=30 cost=533.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:subsetE) (A:fofType) (B:fofType) (Xx:fofType) (x0:((subset A) B)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------