TSTP Solution File: SEU568^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU568^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 : n179.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.78s
% Output : Proof 0.78s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU568^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n179.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:11 CDT 2014
% % CPUTime : 0.78
% 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 0x19d0b90>, <kernel.DependentProduct object at 0x19d0c68>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1d46050>, <kernel.DependentProduct object at 0x19d0c68>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x19d06c8>, <kernel.Sort object at 0x193a3b0>) of role type named notsubsetI_type
% Using role type
% Declaring notsubsetI:Prop
% FOF formula (((eq Prop) notsubsetI) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(((subset A) B)->False))))) of role definition named notsubsetI
% A new definition: (((eq Prop) notsubsetI) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(((subset A) B)->False)))))
% Defined: notsubsetI:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(((subset A) B)->False))))
% FOF formula (<kernel.Constant object at 0x19d0bd8>, <kernel.Sort object at 0x193a3b0>) of role type named notequalI1_type
% Using role type
% Declaring notequalI1:Prop
% FOF formula (((eq Prop) notequalI1) (forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B))))) of role definition named notequalI1
% A new definition: (((eq Prop) notequalI1) (forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B)))))
% Defined: notequalI1:=(forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B))))
% FOF formula (notsubsetI->(notequalI1->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B))))))) of role conjecture named notequalI2
% Conjecture to prove = (notsubsetI->(notequalI1->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(notsubsetI->(notequalI1->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B)))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter subset:(fofType->(fofType->Prop)).
% Definition notsubsetI:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(((subset A) B)->False)))):Prop.
% Definition notequalI1:=(forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B)))):Prop.
% Trying to prove (notsubsetI->(notequalI1->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B)))))))
% Found x300:=(x30 x1):((in Xx) B)
% Found (x30 x1) as proof of ((in Xx) B)
% Found ((x3 (in Xx)) x1) as proof of ((in Xx) B)
% Found ((x3 (in Xx)) x1) as proof of ((in Xx) B)
% Found (x2 ((x3 (in Xx)) x1)) as proof of False
% Found (fun (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of False
% Found (fun (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of (not (((eq fofType) A) B))
% Found (fun (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of ((((in Xx) B)->False)->(not (((eq fofType) A) B)))
% Found (fun (Xx:fofType) (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B))))
% Found (fun (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of (forall (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B)))))
% Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of (forall (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B)))))
% Found (fun (x0:notequalI1) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B)))))
% Found (fun (x:notsubsetI) (x0:notequalI1) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of (notequalI1->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B))))))
% Found (fun (x:notsubsetI) (x0:notequalI1) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1))) as proof of (notsubsetI->(notequalI1->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->(not (((eq fofType) A) B)))))))
% Got proof (fun (x:notsubsetI) (x0:notequalI1) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1)))
% Time elapsed = 0.464029s
% node=43 cost=131.000000 depth=12
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:notsubsetI) (x0:notequalI1) (A:fofType) (B:fofType) (Xx:fofType) (x1:((in Xx) A)) (x2:(((in Xx) B)->False)) (x3:(((eq fofType) A) B))=> (x2 ((x3 (in Xx)) x1)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------