%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU761^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 : n092.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:33:02 EDT 2014 % Result : Theorem 0.72s % Output : Proof 0.72s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU761^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n092.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:25:06 CDT 2014 % % CPUTime : 0.72 % 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 0x9b5c20>, <kernel.DependentProduct object at 0xd92560>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x9b5cb0>, <kernel.DependentProduct object at 0xd927a0>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0xded998>, <kernel.DependentProduct object at 0xd92488>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x9b5cb0>, <kernel.Sort object at 0x87a098>) 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 0xd92a70>, <kernel.Sort object at 0x87a098>) 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 0xd92a28>, <kernel.DependentProduct object at 0xd92560>) of role type named binintersect_type % Using role type % Declaring binintersect:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0xd921b8>, <kernel.Sort object at 0x87a098>) 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 (subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z))))))))))))) of role conjecture named woz13rule3 % Conjecture to prove = (subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z))))))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z)))))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->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. % 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. % Trying to prove (subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z))))))))))))) % Found x000000:=(x00000 x8):((in Xx) Y) % Found (x00000 x8) as proof of ((in Xx) Y) % Found ((x0000 x5) x8) as proof of ((in Xx) Y) % Found (((x000 X) x5) x8) as proof of ((in Xx) Y) % Found ((((fun (A0:fofType)=> ((x00 A0) Xx)) X) x5) x8) as proof of ((in Xx) Y) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8) as proof of ((in Xx) Y) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8) as proof of ((in Xx) Y) % Found x000000:=(x00000 x8):((in Xx) Z) % Found (x00000 x8) as proof of ((in Xx) Z) % Found ((x0000 x6) x8) as proof of ((in Xx) Z) % Found (((x000 X) x6) x8) as proof of ((in Xx) Z) % Found ((((fun (A0:fofType)=> ((x00 A0) Xx)) X) x6) x8) as proof of ((in Xx) Z) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8) as proof of ((in Xx) Z) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8) as proof of ((in Xx) Z) % Found ((x1000 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8)) as proof of ((in Xx) ((binintersect Y) Z)) % Found (((x100 Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8)) as proof of ((in Xx) ((binintersect Y) Z)) % Found ((((x10 Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8)) as proof of ((in Xx) ((binintersect Y) Z)) % Found (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8)) as proof of ((in Xx) ((binintersect Y) Z)) % Found (fun (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))) as proof of ((in Xx) ((binintersect Y) Z)) % Found (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))) as proof of (((in Xx) X)->((in Xx) ((binintersect Y) Z))) % Found (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))) as proof of (forall (Xx:fofType), (((in Xx) X)->((in Xx) ((binintersect Y) Z)))) % Found (x70 (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8)))) as proof of ((subset X) ((binintersect Y) Z)) % Found ((x7 ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8)))) as proof of ((subset X) ((binintersect Y) Z)) % Found (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8)))) as proof of ((subset X) ((binintersect Y) Z)) % Found (fun (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of ((subset X) ((binintersect Y) Z)) % Found (fun (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (((subset X) Z)->((subset X) ((binintersect Y) Z))) % Found (fun (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z)))) % Found (fun (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z))))) % Found (fun (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z)))))) % Found (fun (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z))))))) % Found (fun (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z)))))))) % Found (fun (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z))))))))) % Found (fun (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (forall (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z)))))))))) % Found (fun (x1:binintersectI) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z)))))))))) % Found (fun (x0:subsetE) (x1:binintersectI) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (binintersectI->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z))))))))))) % Found (fun (x:subsetI1) (x0:subsetE) (x1:binintersectI) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (subsetE->(binintersectI->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z)))))))))))) % Found (fun (x:subsetI1) (x0:subsetE) (x1:binintersectI) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) as proof of (subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Z:fofType), (((in Z) (powerset A))->(((subset X) Y)->(((subset X) Z)->((subset X) ((binintersect Y) Z))))))))))))) % Got proof (fun (x:subsetI1) (x0:subsetE) (x1:binintersectI) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) % Time elapsed = 0.391586s % node=62 cost=909.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:binintersectI) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Z:fofType) (x4:((in Z) (powerset A))) (x5:((subset X) Y)) (x6:((subset X) Z))=> (((x X) ((binintersect Y) Z)) (fun (Xx:fofType) (x8:((in Xx) X))=> (((((x1 Y) Z) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Y)) A0) Xx)) X) x5) x8)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) Z)) A0) Xx)) X) x6) x8))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------