%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU733^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 : n116.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:57 EDT 2014 % Result : Theorem 0.73s % Output : Proof 0.73s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU733^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n116.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:26 CDT 2014 % % CPUTime : 0.73 % 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 0x2017f38>, <kernel.DependentProduct object at 0x2017a28>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x21da248>, <kernel.DependentProduct object at 0x2017908>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x2017c20>, <kernel.DependentProduct object at 0x2017a70>) of role type named binintersect_type % Using role type % Declaring binintersect:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x2017998>, <kernel.DependentProduct object at 0x2017f38>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x2017ea8>, <kernel.Sort object at 0x1eddc68>) of role type named setminusI_type % Using role type % Declaring setminusI:Prop % FOF formula (((eq Prop) setminusI) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->((in Xx) ((setminus A) B)))))) of role definition named setminusI % A new definition: (((eq Prop) setminusI) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->((in Xx) ((setminus A) B)))))) % Defined: setminusI:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->((in Xx) ((setminus A) B))))) % FOF formula (<kernel.Constant object at 0x2017950>, <kernel.Sort object at 0x1eddc68>) of role type named complementTnotintersectT_type % Using role type % Declaring complementTnotintersectT:Prop % FOF formula (((eq Prop) complementTnotintersectT) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->(((in Xx) ((binintersect X) Y))->False))))))))) of role definition named complementTnotintersectT % A new definition: (((eq Prop) complementTnotintersectT) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->(((in Xx) ((binintersect X) Y))->False))))))))) % Defined: complementTnotintersectT:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->(((in Xx) ((binintersect X) Y))->False)))))))) % FOF formula (setminusI->(complementTnotintersectT->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))))))) of role conjecture named complementImpComplementIntersect % Conjecture to prove = (setminusI->(complementTnotintersectT->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setminusI->(complementTnotintersectT->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter binintersect:(fofType->(fofType->fofType)). % Parameter setminus:(fofType->(fofType->fofType)). % Definition setminusI:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->((in Xx) ((setminus A) B))))):Prop. % Definition complementTnotintersectT:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->(((in Xx) ((binintersect X) Y))->False)))))))):Prop. % Trying to prove (setminusI->(complementTnotintersectT->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))))))) % Found x3:((in Xx) A) % Found x3 as proof of ((in Xx) A) % Found x00000000:=(x0000000 x4):False % Found (x0000000 x4) as proof of False % Found ((x000000 x3) x4) as proof of False % Found (((x00000 x2) x3) x4) as proof of False % Found ((((x0000 x1) x2) x3) x4) as proof of False % Found (((((x000 A) x1) x2) x3) x4) as proof of False % Found ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> ((((((x00 A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4) as proof of False % Found ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4) as proof of False % Found (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)) as proof of False % Found (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)) as proof of (((in Xx) ((binintersect X) Y))->False) % Found ((x500 x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4))) as proof of ((in Xx) ((setminus A) ((binintersect X) Y))) % Found (((x50 Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4))) as proof of ((in Xx) ((setminus A) ((binintersect X) Y))) % Found ((((x5 ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4))) as proof of ((in Xx) ((setminus A) ((binintersect X) Y))) % Found (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4))) as proof of ((in Xx) ((setminus A) ((binintersect X) Y))) % Found (fun (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of ((in Xx) ((setminus A) ((binintersect X) Y))) % Found (fun (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of (((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))) % Found (fun (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))) % Found (fun (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))) % Found (fun (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))))) % Found (fun (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))) % Found (fun (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))))))) % Found (fun (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) 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) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))))) % Found (fun (x0:complementTnotintersectT) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) 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) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))))) % Found (fun (x:setminusI) (x0:complementTnotintersectT) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of (complementTnotintersectT->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y))))))))))) % Found (fun (x:setminusI) (x0:complementTnotintersectT) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) as proof of (setminusI->(complementTnotintersectT->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) X))->((in Xx) ((setminus A) ((binintersect X) Y)))))))))))) % Got proof (fun (x:setminusI) (x0:complementTnotintersectT) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) % Time elapsed = 0.402533s % node=57 cost=813.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:setminusI) (x0:complementTnotintersectT) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) X)))=> (((((x A) ((binintersect X) Y)) Xx) x3) (fun (x6:((in Xx) ((binintersect X) Y)))=> ((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0))) (x9:((in Xx) A0)) (x10:((in Xx) ((setminus A0) X)))=> (((((((fun (A0:fofType) (x7:((in X) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((x0 A0) X) x7) Y) x8) Xx)) A0) x7) x8) x9) x10) x6)) A) x1) x2) x3) x4)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------