TSTP Solution File: SEU734^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU734^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 : n116.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:57 EDT 2014
% Result : Unknown 0.75s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU734^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n116.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 11:20:31 CDT 2014
% % CPUTime : 0.75
% 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 0x1ec20e0>, <kernel.DependentProduct object at 0x1ec25a8>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1e4e3b0>, <kernel.DependentProduct object at 0x1ec2f80>) of role type named powerset_type
% Using role type
% Declaring powerset:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x1ec23f8>, <kernel.DependentProduct object at 0x1ec2320>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x1ec2998>, <kernel.DependentProduct object at 0x1ec20e0>) of role type named binintersect_type
% Using role type
% Declaring binintersect:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x1ec21b8>, <kernel.DependentProduct object at 0x1ec2f80>) of role type named setminus_type
% Using role type
% Declaring setminus:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x1ec2320>, <kernel.Sort object at 0x1d24cb0>) of role type named binintersectT_lem_type
% Using role type
% Declaring binintersectT_lem:Prop
% FOF formula (((eq Prop) binintersectT_lem) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((binintersect X) Y)) (powerset A))))))) of role definition named binintersectT_lem
% A new definition: (((eq Prop) binintersectT_lem) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((binintersect X) Y)) (powerset A)))))))
% Defined: binintersectT_lem:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((binintersect X) Y)) (powerset A))))))
% FOF formula (<kernel.Constant object at 0x1ec20e0>, <kernel.Sort object at 0x1d24cb0>) of role type named complementT_lem_type
% Using role type
% Declaring complementT_lem:Prop
% FOF formula (((eq Prop) complementT_lem) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->((in ((setminus A) X)) (powerset A))))) of role definition named complementT_lem
% A new definition: (((eq Prop) complementT_lem) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->((in ((setminus A) X)) (powerset A)))))
% Defined: complementT_lem:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->((in ((setminus A) X)) (powerset A))))
% FOF formula (<kernel.Constant object at 0x1ec2998>, <kernel.Sort object at 0x1d24cb0>) of role type named subsetTI_type
% Using role type
% Declaring subsetTI:Prop
% FOF formula (((eq Prop) subsetTI) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))->((subset X) Y))))))) of role definition named subsetTI
% A new definition: (((eq Prop) subsetTI) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))->((subset X) Y)))))))
% Defined: subsetTI:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))->((subset X) Y))))))
% FOF formula (<kernel.Constant object at 0x1ec20e0>, <kernel.Sort object at 0x1d24cb0>) of role type named complementImpComplementIntersect_type
% Using role type
% Declaring complementImpComplementIntersect:Prop
% FOF formula (((eq Prop) complementImpComplementIntersect) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))))))))) of role definition named complementImpComplementIntersect
% A new definition: (((eq Prop) complementImpComplementIntersect) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))))))
% Defined: complementImpComplementIntersect:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))))))))
% FOF formula (binintersectT_lem->(complementT_lem->(subsetTI->(complementImpComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y))))))))))) of role conjecture named complementSubsetComplementIntersect
% Conjecture to prove = (binintersectT_lem->(complementT_lem->(subsetTI->(complementImpComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y))))))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(binintersectT_lem->(complementT_lem->(subsetTI->(complementImpComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))))))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter powerset:(fofType->fofType).
% Parameter subset:(fofType->(fofType->Prop)).
% Parameter binintersect:(fofType->(fofType->fofType)).
% Parameter setminus:(fofType->(fofType->fofType)).
% Definition binintersectT_lem:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((binintersect X) Y)) (powerset A)))))):Prop.
% Definition complementT_lem:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->((in ((setminus A) X)) (powerset A)))):Prop.
% Definition subsetTI:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))->((subset X) Y)))))):Prop.
% Definition complementImpComplementIntersect:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))))):Prop.
% Trying to prove (binintersectT_lem->(complementT_lem->(subsetTI->(complementImpComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))))))))))
% Found x5:((in Xx) A0)
% Instantiate: A0:=((setminus A) ((binintersect X) Y)):fofType
% Found (fun (x6:((in Xx) ((setminus A) X)))=> x5) as proof of ((in Xx) ((setminus A) ((binintersect X) Y)))
% Found (fun (x5:((in Xx) A0)) (x6:((in Xx) ((setminus A) X)))=> x5) as proof of (((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))
% Found (fun (Xx:fofType) (x5:((in Xx) A0)) (x6:((in Xx) ((setminus A) X)))=> x5) as proof of (((in Xx) A0)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))
% Found (fun (Xx:fofType) (x5:((in Xx) A0)) (x6:((in Xx) ((setminus A) X)))=> x5) as proof of (forall (Xx:fofType), (((in Xx) A0)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))))
% Found x0000:=(x000 x3):((in ((setminus A) X)) (powerset A))
% Found (x000 x3) as proof of ((in ((setminus A) X)) (powerset A0))
% Found ((x00 X) x3) as proof of ((in ((setminus A) X)) (powerset A0))
% Found (((x0 A) X) x3) as proof of ((in ((setminus A) X)) (powerset A0))
% Found (((x0 A) X) x3) as proof of ((in ((setminus A) X)) (powerset A0))
% Found (((x0 A) X) x3) as proof of ((in ((setminus A) X)) (powerset A0))
% Found x50000:=(x5000 x4):((in ((binintersect X) Y)) (powerset A))
% Found (x5000 x4) as proof of ((in ((binintersect X) Y)) (powerset A))
% Found ((x500 Y) x4) as proof of ((in ((binintersect X) Y)) (powerset A))
% Found (((x50 x3) Y) x4) as proof of ((in ((binintersect X) Y)) (powerset A))
% Found ((((x5 X) x3) Y) x4) as proof of ((in ((binintersect X) Y)) (powerset A))
% Found (((((x A) X) x3) Y) x4) as proof of ((in ((binintersect X) Y)) (powerset A))
% Found (((((x A) X) x3) Y) x4) as proof of ((in ((binintersect X) Y)) (powerset A))
% Found (x000 (((((x A) X) x3) Y) x4)) as proof of ((in ((setminus A) ((binintersect X) Y))) (powerset A0))
% Found ((x00 ((binintersect X) Y)) (((((x A) X) x3) Y) x4)) as proof of ((in ((setminus A) ((binintersect X) Y))) (powerset A0))
% Found (((x0 A) ((binintersect X) Y)) (((((x A) X) x3) Y) x4)) as proof of ((in ((setminus A) ((binintersect X) Y))) (powerset A0))
% Found (((x0 A) ((binintersect X) Y)) (((((x A) X) x3) Y) x4)) as proof of ((in ((setminus A) ((binintersect X) Y))) (powerset A0))
% Found (((x0 A) ((binintersect X) Y)) (((((x A) X) x3) Y) x4)) as proof of ((in ((setminus A) ((binintersect X) Y))) (powerset A0))
% % SZS status GaveUp for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------