%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU593^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 : n185.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:33 EDT 2014 % Result : Theorem 4.50s % Output : Proof 4.50s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU593^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n185.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:01 CDT 2014 % % CPUTime : 4.50 % 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 0xd36e18>, <kernel.DependentProduct object at 0xd36320>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xd181b8>, <kernel.DependentProduct object at 0xd363b0>) of role type named dsetconstr_type % Using role type % Declaring dsetconstr:(fofType->((fofType->Prop)->fofType)) % FOF formula (<kernel.Constant object at 0xd364d0>, <kernel.DependentProduct object at 0xf8dbd8>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xd36e18>, <kernel.Sort object at 0xde8b90>) 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 0xd36ea8>, <kernel.Sort object at 0xde8b90>) 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 0xd36ea8>, <kernel.Sort object at 0xde8b90>) 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 0xd36ea8>, <kernel.DependentProduct object at 0xf8dd88>) of role type named binintersect_type % Using role type % Declaring binintersect:(fofType->(fofType->fofType)) % FOF formula (((eq (fofType->(fofType->fofType))) binintersect) (fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B))))) of role definition named binintersect % A new definition: (((eq (fofType->(fofType->fofType))) binintersect) (fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B))))) % Defined: binintersect:=(fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B)))) % FOF formula (<kernel.Constant object at 0xf8dd88>, <kernel.Sort object at 0xde8b90>) 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 0xf8d830>, <kernel.Sort object at 0xde8b90>) of role type named binintersectLsub_type % Using role type % Declaring binintersectLsub:Prop % FOF formula (((eq Prop) binintersectLsub) (forall (A:fofType) (B:fofType), ((subset ((binintersect A) B)) A))) of role definition named binintersectLsub % A new definition: (((eq Prop) binintersectLsub) (forall (A:fofType) (B:fofType), ((subset ((binintersect A) B)) A))) % Defined: binintersectLsub:=(forall (A:fofType) (B:fofType), ((subset ((binintersect A) B)) A)) % FOF formula (subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A)))))))) of role conjecture named binintersectSubset2 % Conjecture to prove = (subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A)))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)). % 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. % Definition binintersect:=(fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B)))):(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 binintersectLsub:=(forall (A:fofType) (B:fofType), ((subset ((binintersect A) B)) A)):Prop. % Trying to prove (subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A)))))))) % Found x300:=(x30 B):((subset ((binintersect A) B)) A) % Found (x30 B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found x300:=(x30 B):((subset ((binintersect A) B)) A) % Found (x30 B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found x300:=(x30 B):((subset ((binintersect A) B)) A) % Found (x30 B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found x6:((in Xx) A) % Found x6 as proof of ((in Xx) A) % 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) A) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) A) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) A) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) A) % Found x300:=(x30 B):((subset ((binintersect A) B)) A) % Found (x30 B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found x300:=(x30 B):((subset ((binintersect A) B)) A) % Found (x30 B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found x300:=(x30 B):((subset ((binintersect A) B)) A) % Found (x30 B) as proof of ((subset b) A) % Found ((x3 A) B) as proof of ((subset b) A) % Found ((x3 A) B) as proof of ((subset b) A) % Found x300:=(x30 B):((subset ((binintersect A) B)) A) % Found (x30 B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found ((x3 A) B) as proof of ((subset ((binintersect A) B)) A) % Found x50:(P A) % Found (fun (x50:(P A))=> x50) as proof of (P A) % Found (fun (x50:(P A))=> x50) as proof of (P0 A) % Found x6:((in Xx) A) % Found x6 as proof of ((in Xx) A) % Found x6:((in Xx) A) % Found x6 as proof of ((in Xx) A) % Found eq_ref00:=(eq_ref0 A):(((eq fofType) A) A) % Found (eq_ref0 A) as proof of (((eq fofType) A) b) % Found ((eq_ref fofType) A) as proof of (((eq fofType) A) b) % Found ((eq_ref fofType) A) as proof of (((eq fofType) A) b) % Found ((eq_ref fofType) A) as proof of (((eq fofType) A) 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 x300:=(x30 B):((subset ((binintersect A) B)) A) % 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)) A) % Found (x30 B) as proof of ((subset b) A) % Found ((x3 A) B) as proof of ((subset b) A) % Found ((x3 A) B) as proof of ((subset b) A) % Found x6:((in Xx) A) % Found x6 as proof of ((in Xx) A) % Found x6:((in Xx) A) % Found x6 as proof of ((in Xx) A) % Found x6:((in Xx) A) % Found x6 as proof of ((in Xx) A) % Found x6:((in Xx) A) % Found x6 as proof of ((in Xx) A) % Found x000000:=(x00000 x6):((in Xx) B) % Found (x00000 x6) as proof of ((in Xx) B) % Found ((x0000 x4) x6) as proof of ((in Xx) B) % Found (((x000 A) x4) x6) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> ((x00 A0) Xx)) A) x4) x6) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6) as proof of ((in Xx) B) % Found ((x2000 x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)) as proof of ((in Xx) ((binintersect A) B)) % Found (((x200 Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)) as proof of ((in Xx) ((binintersect A) B)) % Found ((((x20 B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)) as proof of ((in Xx) ((binintersect A) B)) % Found (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)) as proof of ((in Xx) ((binintersect A) B)) % Found (fun (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6))) as proof of ((in Xx) ((binintersect A) B)) % Found (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6))) as proof of (((in Xx) A)->((in Xx) ((binintersect A) B))) % Found (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6))) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) ((binintersect A) B)))) % Found (x50 (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))) as proof of ((subset A) ((binintersect A) B)) % Found ((x5 ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))) as proof of ((subset A) ((binintersect A) B)) % Found (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))) as proof of ((subset A) ((binintersect A) B)) % Found (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))) as proof of ((subset A) ((binintersect A) B)) % Found ((x100 ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6))))) as proof of (((eq fofType) ((binintersect A) B)) A) % Found (((x10 A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6))))) as proof of (((eq fofType) ((binintersect A) B)) A) % Found ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6))))) as proof of (((eq fofType) ((binintersect A) B)) A) % Found (fun (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (((eq fofType) ((binintersect A) B)) A) % Found (fun (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (((subset A) B)->(((eq fofType) ((binintersect A) B)) A)) % Found (fun (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (forall (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A))) % Found (fun (x3:binintersectLsub) (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A))) % Found (fun (x2:binintersectI) (x3:binintersectLsub) (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A)))) % Found (fun (x1:setextsub) (x2:binintersectI) (x3:binintersectLsub) (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (binintersectI->(binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A))))) % Found (fun (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectLsub) (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (setextsub->(binintersectI->(binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A)))))) % Found (fun (x:subsetI1) (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectLsub) (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (subsetE->(setextsub->(binintersectI->(binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A))))))) % Found (fun (x:subsetI1) (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectLsub) (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) as proof of (subsetI1->(subsetE->(setextsub->(binintersectI->(binintersectLsub->(forall (A:fofType) (B:fofType), (((subset A) B)->(((eq fofType) ((binintersect A) B)) A)))))))) % Got proof (fun (x:subsetI1) (x0:subsetE) (x1:setextsub) (x2:binintersectI) (x3:binintersectLsub) (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) % Time elapsed = 4.132216s % node=771 cost=941.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:binintersectLsub) (A:fofType) (B:fofType) (x4:((subset A) B))=> ((((x1 ((binintersect A) B)) A) ((x3 A) B)) (((x A) ((binintersect A) B)) (fun (Xx:fofType) (x6:((in Xx) A))=> (((((x2 A) B) Xx) x6) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) A) x4) x6)))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------