%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU735^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 : n180.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:58 EDT 2014

% Result   : Theorem 0.45s
% Output   : Proof 0.45s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU735^2 : TPTP v6.1.0. Released v3.7.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n180.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.45 
% 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 0x2102f38>, <kernel.DependentProduct object at 0x21029e0>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x24da1b8>, <kernel.DependentProduct object at 0x2102488>) of role type named powerset_type
% Using role type
% Declaring powerset:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x2102830>, <kernel.DependentProduct object at 0x2102d40>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x21025f0>, <kernel.Sort object at 0x1fe5518>) of role type named powersetI1_type
% Using role type
% Declaring powersetI1:Prop
% FOF formula (((eq Prop) powersetI1) (forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A))))) of role definition named powersetI1
% A new definition: (((eq Prop) powersetI1) (forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A)))))
% Defined: powersetI1:=(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A))))
% FOF formula (<kernel.Constant object at 0x21026c8>, <kernel.DependentProduct object at 0x2102f38>) of role type named binintersect_type
% Using role type
% Declaring binintersect:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x2102830>, <kernel.DependentProduct object at 0x2102488>) of role type named setminus_type
% Using role type
% Declaring setminus:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0x2102cb0>, <kernel.Sort object at 0x1fe5518>) of role type named complementSubsetComplementIntersect_type
% Using role type
% Declaring complementSubsetComplementIntersect:Prop
% FOF formula (((eq Prop) complementSubsetComplementIntersect) (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 definition named complementSubsetComplementIntersect
% A new definition: (((eq Prop) complementSubsetComplementIntersect) (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))))))))
% Defined: complementSubsetComplementIntersect:=(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)))))))
% FOF formula (powersetI1->(complementSubsetComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y)))))))))) of role conjecture named complementInPowersetComplementIntersect
% Conjecture to prove = (powersetI1->(complementSubsetComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y)))))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(powersetI1->(complementSubsetComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter powerset:(fofType->fofType).
% Parameter subset:(fofType->(fofType->Prop)).
% Definition powersetI1:=(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A)))):Prop.
% Parameter binintersect:(fofType->(fofType->fofType)).
% Parameter setminus:(fofType->(fofType->fofType)).
% Definition complementSubsetComplementIntersect:=(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.
% Trying to prove (powersetI1->(complementSubsetComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))))))))
% Found x000000:=(x00000 x2):((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))
% Found (x00000 x2) as proof of ((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))
% Found ((x0000 Y) x2) as proof of ((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))
% Found (((x000 x1) Y) x2) as proof of ((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))
% Found ((((x00 X) x1) Y) x2) as proof of ((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))
% Found (((((x0 A) X) x1) Y) x2) as proof of ((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))
% Found (((((x0 A) X) x1) Y) x2) as proof of ((subset ((setminus A) X)) ((setminus A) ((binintersect X) Y)))
% Found (x30 (((((x0 A) X) x1) Y) x2)) as proof of ((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))
% Found ((x3 ((setminus A) X)) (((((x0 A) X) x1) Y) x2)) as proof of ((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))
% Found (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2)) as proof of ((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))
% Found (fun (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2))) as proof of ((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))
% Found (fun (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2))) as proof of (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y)))))
% Found (fun (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))))
% Found (fun (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y)))))))
% Found (fun (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2))) as proof of (forall (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))))))
% Found (fun (x0:complementSubsetComplementIntersect) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2))) as proof of (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))))))
% Found (fun (x:powersetI1) (x0:complementSubsetComplementIntersect) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2))) as proof of (complementSubsetComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y)))))))))
% Found (fun (x:powersetI1) (x0:complementSubsetComplementIntersect) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2))) as proof of (powersetI1->(complementSubsetComplementIntersect->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((in ((setminus A) X)) (powerset ((setminus A) ((binintersect X) Y))))))))))
% Got proof (fun (x:powersetI1) (x0:complementSubsetComplementIntersect) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2)))
% Time elapsed = 0.126507s
% node=17 cost=244.000000 depth=16
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:powersetI1) (x0:complementSubsetComplementIntersect) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A)))=> (((x ((setminus A) ((binintersect X) Y))) ((setminus A) X)) (((((x0 A) X) x1) Y) x2)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------