%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU715^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 : n097.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:54 EDT 2014 % Result : Theorem 6.80s % Output : Proof 6.80s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU715^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n097.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:17:06 CDT 2014 % % CPUTime : 6.80 % 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 0x117f950>, <kernel.DependentProduct object at 0x117fb90>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x15b9098>, <kernel.DependentProduct object at 0x117f9e0>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x117fb48>, <kernel.Sort object at 0x1049cf8>) of role type named setext_type % Using role type % Declaring setext:Prop % FOF formula (((eq Prop) setext) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B))))) of role definition named setext % A new definition: (((eq Prop) setext) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B))))) % Defined: setext:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B)))) % FOF formula (<kernel.Constant object at 0x117fcb0>, <kernel.Sort object at 0x1049cf8>) of role type named powersetE_type % Using role type % Declaring powersetE:Prop % FOF formula (((eq Prop) powersetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A))))) of role definition named powersetE % A new definition: (((eq Prop) powersetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A))))) % Defined: powersetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A)))) % FOF formula (setext->(powersetE->(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))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y))))))))) of role conjecture named setextT % Conjecture to prove = (setext->(powersetE->(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))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setext->(powersetE->(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))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y)))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Definition setext:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->(((eq fofType) A) B)))):Prop. % Definition powersetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A)))):Prop. % Trying to prove (setext->(powersetE->(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))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y))))))))) % Found x60:(P X) % Found (fun (x60:(P X))=> x60) as proof of (P X) % Found (fun (x60:(P X))=> x60) as proof of (P0 X) % Found x50:(P X) % Found (fun (x50:(P X))=> x50) as proof of (P X) % Found (fun (x50:(P X))=> x50) as proof of (P0 X) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found eq_ref00:=(eq_ref0 X):(((eq fofType) X) X) % Found (eq_ref0 X) as proof of (((eq fofType) X) b) % Found ((eq_ref fofType) X) as proof of (((eq fofType) X) b) % Found ((eq_ref fofType) X) as proof of (((eq fofType) X) b) % Found ((eq_ref fofType) X) as proof of (((eq fofType) X) b) % Found eq_ref00:=(eq_ref0 b):(((eq fofType) b) b) % Found (eq_ref0 b) as proof of (((eq fofType) b) Y) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) Y) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) Y) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) Y) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found x60:(P Y) % Found (fun (x60:(P Y))=> x60) as proof of (P Y) % Found (fun (x60:(P Y))=> x60) as proof of (P0 Y) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found eq_ref00:=(eq_ref0 Y):(((eq fofType) Y) Y) % Found (eq_ref0 Y) as proof of (((eq fofType) Y) b) % Found ((eq_ref fofType) Y) as proof of (((eq fofType) Y) b) % Found ((eq_ref fofType) Y) as proof of (((eq fofType) Y) b) % Found ((eq_ref fofType) Y) as proof of (((eq fofType) Y) b) % Found eq_ref00:=(eq_ref0 b):(((eq fofType) b) b) % Found (eq_ref0 b) as proof of (((eq fofType) b) X) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) X) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) X) % Found ((eq_ref fofType) b) as proof of (((eq fofType) b) X) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found x6:((in Xx) X) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found x6:((in Xx) b) % Found x6 as proof of ((in Xx) X) % Found x6:((in Xx) Y) % Found x6 as proof of ((in Xx) Y) % Found x000000:=(x00000 x6):((in Xx) A) % Found (x00000 x6) as proof of ((in Xx) A) % Found ((x0000 x1) x6) as proof of ((in Xx) A) % Found (((x000 X) x1) x6) as proof of ((in Xx) A) % Found ((((fun (B:fofType)=> ((x00 B) Xx)) X) x1) x6) as proof of ((in Xx) A) % Found ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6) as proof of ((in Xx) A) % Found ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6) as proof of ((in Xx) A) % Found ((x30 ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6) as proof of ((in Xx) Y) % Found (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6) as proof of ((in Xx) Y) % Found (fun (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6)) as proof of ((in Xx) Y) % Found (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6)) as proof of (((in Xx) X)->((in Xx) Y)) % Found (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6)) as proof of (forall (Xx:fofType), (((in Xx) X)->((in Xx) Y))) % Found x000000:=(x00000 x6):((in Xx) A) % Found (x00000 x6) as proof of ((in Xx) A) % Found ((x0000 x2) x6) as proof of ((in Xx) A) % Found (((x000 Y) x2) x6) as proof of ((in Xx) A) % Found ((((fun (B:fofType)=> ((x00 B) Xx)) Y) x2) x6) as proof of ((in Xx) A) % Found ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6) as proof of ((in Xx) A) % Found ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6) as proof of ((in Xx) A) % Found ((x40 ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6) as proof of ((in Xx) X) % Found (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6) as proof of ((in Xx) X) % Found (fun (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)) as proof of ((in Xx) X) % Found (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)) as proof of (((in Xx) Y)->((in Xx) X)) % Found (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)) as proof of (forall (Xx:fofType), (((in Xx) Y)->((in Xx) X))) % Found ((x50 (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6))) as proof of (((eq fofType) X) Y) % Found (((x5 Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6))) as proof of (((eq fofType) X) Y) % Found ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6))) as proof of (((eq fofType) X) Y) % Found (fun (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of (((eq fofType) X) Y) % Found (fun (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of ((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y)) % Found (fun (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of ((forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y))) % Found (fun (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of (((in Y) (powerset A))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y)))) % Found (fun (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y))))) % Found (fun (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y)))))) % Found (fun (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of (forall (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))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y))))))) % Found (fun (x0:powersetE) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of (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))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y))))))) % Found (fun (x:setext) (x0:powersetE) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of (powersetE->(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))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y)))))))) % Found (fun (x:setext) (x0:powersetE) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) as proof of (setext->(powersetE->(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))))->((forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X))))->(((eq fofType) X) Y))))))))) % Got proof (fun (x:setext) (x0:powersetE) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) % Time elapsed = 6.401166s % node=1464 cost=681.000000 depth=23 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setext) (x0:powersetE) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (x3:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) Y))))) (x4:(forall (Xx:fofType), (((in Xx) A)->(((in Xx) Y)->((in Xx) X)))))=> ((((x X) Y) (fun (Xx:fofType) (x6:((in Xx) X))=> (((x3 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) X) x1) x6)) x6))) (fun (Xx:fofType) (x6:((in Xx) Y))=> (((x4 Xx) ((((fun (B:fofType)=> (((x0 A) B) Xx)) Y) x2) x6)) x6)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------