TSTP Solution File: SEU598^2 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEU598^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 : n111.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:34 EDT 2014
% Result : Theorem 4.61s
% Output : Proof 4.61s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEU598^2 : TPTP v6.1.0. Released v3.7.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n111.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:50:56 CDT 2014
% % CPUTime : 4.61
% 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 0xc34d88>, <kernel.DependentProduct object at 0xc34d40>) of role type named in_type
% Using role type
% Declaring in:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0x102c710>, <kernel.DependentProduct object at 0xc34d40>) of role type named subset_type
% Using role type
% Declaring subset:(fofType->(fofType->Prop))
% FOF formula (<kernel.Constant object at 0xc34950>, <kernel.Sort object at 0xee2998>) of role type named subsetI1_type
% Using role type
% Declaring subsetI1:Prop
% FOF formula (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI1
% A new definition: (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))))
% Defined: subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))
% FOF formula (<kernel.Constant object at 0xc34ef0>, <kernel.Sort object at 0xee2998>) 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 (<kernel.Constant object at 0xb1a560>, <kernel.Sort object at 0xee2998>) of role type named setextsub_type
% Using role type
% Declaring setextsub:Prop
% FOF formula (((eq Prop) setextsub) (forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B))))) of role definition named setextsub
% A new definition: (((eq Prop) setextsub) (forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))))
% Defined: setextsub:=(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B))))
% FOF formula (<kernel.Constant object at 0xc34368>, <kernel.DependentProduct object at 0xc34ab8>) of role type named binintersect_type
% Using role type
% Declaring binintersect:(fofType->(fofType->fofType))
% FOF formula (<kernel.Constant object at 0xc347e8>, <kernel.Sort object at 0xee2998>) of role type named binintersectI_type
% Using role type
% Declaring binintersectI:Prop
% FOF formula (((eq Prop) binintersectI) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B)))))) of role definition named binintersectI
% A new definition: (((eq Prop) binintersectI) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))))
% Defined: binintersectI:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B)))))
% FOF formula (<kernel.Constant object at 0x1009cb0>, <kernel.Sort object at 0xee2998>) of role type named binintersectRsub_type
% Using role type
% Declaring binintersectRsub:Prop
% FOF formula (((eq Prop) binintersectRsub) (forall (A:fofType) (B:fofType), ((subset ((binintersect A) B)) B))) of role definition named binintersectRsub
% A new definition: (((eq Prop) binintersectRsub) (forall (A:fofType) (B:fofType), ((subset ((binintersect A) B)) B)))
% Defined: binintersectRsub:=(forall (A:fofType) (B:fofType), ((subset ((binintersect A) B)) B))
% FOF formula (subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B)))))))) of role conjecture named binintersectSubset4
% Conjecture to prove = (subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B)))))))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B))))))))']
% Parameter fofType:Type.
% Parameter in:(fofType->(fofType->Prop)).
% Parameter subset:(fofType->(fofType->Prop)).
% Definition subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop.
% Definition subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))):Prop.
% Definition setextsub:=(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))):Prop.
% Parameter binintersect:(fofType->(fofType->fofType)).
% Definition binintersectI:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))):Prop.
% Definition binintersectRsub:=(forall (A:fofType) (B:fofType), ((subset ((binintersect A) B)) B)):Prop.
% Trying to prove (subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B))))))))
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found x6:((in Xx) B)
% Found x6 as proof of ((in Xx) B)
% Found eq_ref00:=(eq_ref0 ((binintersect A) B)):(((eq fofType) ((binintersect A) B)) ((binintersect A) B))
% Found (eq_ref0 ((binintersect A) B)) as proof of (((eq fofType) ((binintersect A) B)) b)
% Found ((eq_ref fofType) ((binintersect A) B)) as proof of (((eq fofType) ((binintersect A) B)) b)
% Found ((eq_ref fofType) ((binintersect A) B)) as proof of (((eq fofType) ((binintersect A) B)) b)
% Found ((eq_ref fofType) ((binintersect A) B)) as proof of (((eq fofType) ((binintersect A) B)) b)
% Found eq_ref00:=(eq_ref0 b):(((eq fofType) b) b)
% Found (eq_ref0 b) as proof of (((eq fofType) b) B)
% Found ((eq_ref fofType) b) as proof of (((eq fofType) b) B)
% Found ((eq_ref fofType) b) as proof of (((eq fofType) b) B)
% Found ((eq_ref fofType) b) as proof of (((eq fofType) b) B)
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset b) B)
% Found ((x3 A) B) as proof of ((subset b) B)
% Found ((x3 A) B) as proof of ((subset b) B)
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) B)
% Found x50:(P B)
% Found (fun (x50:(P B))=> x50) as proof of (P B)
% Found (fun (x50:(P B))=> x50) as proof of (P0 B)
% Found x6:((in Xx) B)
% Found x6 as proof of ((in Xx) B)
% Found x6:((in Xx) B)
% Found x6 as proof of ((in Xx) B)
% Found eq_ref00:=(eq_ref0 b):(((eq fofType) b) b)
% Found (eq_ref0 b) as proof of (((eq fofType) b) ((binintersect A) B))
% Found ((eq_ref fofType) b) as proof of (((eq fofType) b) ((binintersect A) B))
% Found ((eq_ref fofType) b) as proof of (((eq fofType) b) ((binintersect A) B))
% Found ((eq_ref fofType) b) as proof of (((eq fofType) b) ((binintersect A) B))
% Found eq_ref00:=(eq_ref0 B):(((eq fofType) B) B)
% Found (eq_ref0 B) as proof of (((eq fofType) B) b)
% Found ((eq_ref fofType) B) as proof of (((eq fofType) B) b)
% Found ((eq_ref fofType) B) as proof of (((eq fofType) B) b)
% Found ((eq_ref fofType) B) as proof of (((eq fofType) B) b)
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset b) B)
% Found ((x3 A) B) as proof of ((subset b) B)
% Found ((x3 A) B) as proof of ((subset b) B)
% Found x300:=(x30 B):((subset ((binintersect A) B)) B)
% Found (x30 B) as proof of ((subset b) B)
% Found ((x3 A) B) as proof of ((subset b) B)
% Found ((x3 A) B) as proof of ((subset b) B)
% Found x6:((in Xx) B)
% Found x6 as proof of ((in Xx) B)
% Found x6:((in Xx) B)
% Found x6 as proof of ((in Xx) B)
% Found x6:((in Xx) B)
% Found x6 as proof of ((in Xx) B)
% Found x6:((in Xx) B)
% Found x6 as proof of ((in Xx) B)
% Found x000000:=(x00000 x6):((in Xx) A)
% Found (x00000 x6) as proof of ((in Xx) A)
% Found ((x0000 x4) x6) as proof of ((in Xx) A)
% Found (((x000 B) x4) x6) as proof of ((in Xx) A)
% Found ((((fun (A0:fofType)=> ((x00 A0) Xx)) B) x4) x6) as proof of ((in Xx) A)
% Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6) as proof of ((in Xx) A)
% Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6) as proof of ((in Xx) A)
% Found ((x2000 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6) as proof of ((in Xx) ((binintersect A) B))
% Found (((x200 Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6) as proof of ((in Xx) ((binintersect A) B))
% Found ((((x20 B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6) as proof of ((in Xx) ((binintersect A) B))
% Found (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6) as proof of ((in Xx) ((binintersect A) B))
% Found (fun (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6)) as proof of ((in Xx) ((binintersect A) B))
% Found (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6)) as proof of (((in Xx) B)->((in Xx) ((binintersect A) B)))
% Found (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6)) as proof of (forall (Xx:fofType), (((in Xx) B)->((in Xx) ((binintersect A) B))))
% Found (x50 (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))) as proof of ((subset B) ((binintersect A) B))
% Found ((x5 ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))) as proof of ((subset B) ((binintersect A) B))
% Found (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))) as proof of ((subset B) ((binintersect A) B))
% Found (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))) as proof of ((subset B) ((binintersect A) B))
% Found ((x100 ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6)))) as proof of (((eq fofType) ((binintersect A) B)) B)
% Found (((x10 B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6)))) as proof of (((eq fofType) ((binintersect A) B)) B)
% Found ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6)))) as proof of (((eq fofType) ((binintersect A) B)) B)
% Found (fun (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (((eq fofType) ((binintersect A) B)) B)
% Found (fun (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (((subset B) A)->(((eq fofType) ((binintersect A) B)) B))
% Found (fun (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (forall (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B)))
% Found (fun (x3:binintersectRsub) (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B)))
% Found (fun (x2:binintersectI) (x3:binintersectRsub) (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B))))
% Found (fun (x1:setextsub) (x2:binintersectI) (x3:binintersectRsub) (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (binintersectI->(binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B)))))
% Found (fun (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectRsub) (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (setextsub->(binintersectI->(binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B))))))
% Found (fun (x:subsetI1) (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectRsub) (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (subsetE->(setextsub->(binintersectI->(binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B)))))))
% Found (fun (x:subsetI1) (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectRsub) (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6))))) as proof of (subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectRsub->(forall (A:fofType) (B:fofType), (((subset B) A)->(((eq fofType) ((binintersect A) B)) B))))))))
% Got proof (fun (x:subsetI1) (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectRsub) (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6)))))
% Time elapsed = 4.235996s
% node=869 cost=942.000000 depth=28
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:subsetI1) (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectRsub) (A:fofType) (B:fofType) (x4:((subset B) A))=> ((((x1 ((binintersect A) B)) B) ((x3 A) B)) (((x B) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) B))=> (((((x2 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) B) x4) x6)) x6)))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------