TSTP Solution File: SEU608^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU608^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 : n104.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:36 EDT 2014
% Result : Theorem 0.49s
% Output : Proof 0.49s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU608^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n104.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:52:51 CDT 2014
% % CPUTime : 0.49
% 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 0x16425a8>, <kernel.DependentProduct object at 0x1642ea8>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1642878>, <kernel.DependentProduct object at 0x1642ea8>) of role type named setminus_type
% Using role type
% Declaring setminus:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x16424d0>, <kernel.Sort object at 0x18f0b48>) of role type named setminusER_type
% Using role type
% Declaring setminusER:Prop
% FOF formula (((eq Prop) setminusER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False)))) of role definition named setminusER
% A new definition: (((eq Prop) setminusER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False))))
% Defined: setminusER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False)))
% FOF formula (setminusER->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) B)->(((in Xx) ((setminus A) B))->False)))) of role conjecture named setminusIRneg
% Conjecture to prove = (setminusER->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) B)->(((in Xx) ((setminus A) B))->False)))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(setminusER->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) B)->(((in Xx) ((setminus A) B))->False))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter setminus:(fofType->(fofType->fofType)).
% Definition setminusER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False))):Prop.
% Trying to prove (setminusER->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) B)->(((in Xx) ((setminus A) B))->False))))
% Found x2000:=(x200 x1):False
% Found (x200 x1) as proof of False
% Found ((x20 A) x1) as proof of False
% Found (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> (((x2 A0) x3) x0)) A) x1) as proof of False
% Found (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1) as proof of False
% Found (fun (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1)) as proof of False
% Found (fun (x0:((in Xx) B)) (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1)) as proof of (((in Xx) ((setminus A) B))->False)
% Found (fun (Xx:fofType) (x0:((in Xx) B)) (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1)) as proof of (((in Xx) B)->(((in Xx) ((setminus A) B))->False))
% Found (fun (B:fofType) (Xx:fofType) (x0:((in Xx) B)) (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1)) as proof of (forall (Xx:fofType), (((in Xx) B)->(((in Xx) ((setminus A) B))->False)))
% Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) B)) (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1)) as proof of (forall (B:fofType) (Xx:fofType), (((in Xx) B)->(((in Xx) ((setminus A) B))->False)))
% Found (fun (x:setminusER) (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) B)) (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1)) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) B)->(((in Xx) ((setminus A) B))->False)))
% Found (fun (x:setminusER) (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) B)) (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1)) as proof of (setminusER->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) B)->(((in Xx) ((setminus A) B))->False))))
% Got proof (fun (x:setminusER) (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) B)) (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1))
% Time elapsed = 0.161418s
% node=45 cost=497.000000 depth=10
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:setminusER) (A:fofType) (B:fofType) (Xx:fofType) (x0:((in Xx) B)) (x1:((in Xx) ((setminus A) B)))=> (((fun (A0:fofType) (x3:((in Xx) ((setminus A0) B)))=> ((((fun (A0:fofType)=> (((x A0) B) Xx)) A0) x3) x0)) A) x1))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------