%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU756^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 : n109.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 2.64s % Output : Proof 2.64s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU756^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n109.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:23:56 CDT 2014 % % CPUTime : 2.64 % 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 0x18fa368>, <kernel.DependentProduct object at 0x18fa290>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1605dd0>, <kernel.DependentProduct object at 0x18fa3f8>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x1605dd0>, <kernel.DependentProduct object at 0x18fa320>) of role type named binunion_type % Using role type % Declaring binunion:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x18fa8c0>, <kernel.DependentProduct object at 0x18fa5f0>) of role type named binintersect_type % Using role type % Declaring binintersect:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x18fa3f8>, <kernel.Sort object at 0x19cad40>) of role type named binintersectEL_type % Using role type % Declaring binintersectEL:Prop % FOF formula (((eq Prop) binintersectEL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) A)))) of role definition named binintersectEL % A new definition: (((eq Prop) binintersectEL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) A)))) % Defined: binintersectEL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) A))) % FOF formula (<kernel.Constant object at 0x18fa320>, <kernel.Sort object at 0x19cad40>) of role type named binintersectER_type % Using role type % Declaring binintersectER:Prop % FOF formula (((eq Prop) binintersectER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) B)))) of role definition named binintersectER % A new definition: (((eq Prop) binintersectER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) B)))) % Defined: binintersectER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) B))) % FOF formula (<kernel.Constant object at 0x18fa8c0>, <kernel.DependentProduct object at 0x1919560>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x18fa320>, <kernel.Sort object at 0x19cad40>) of role type named demorgan2b2_type % Using role type % Declaring demorgan2b2:Prop % FOF formula (((eq Prop) demorgan2b2) (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) Y))->((in Xx) ((setminus A) ((binunion X) Y)))))))))))) of role definition named demorgan2b2 % A new definition: (((eq Prop) demorgan2b2) (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) Y))->((in Xx) ((setminus A) ((binunion X) Y)))))))))))) % Defined: demorgan2b2:=(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) Y))->((in Xx) ((setminus A) ((binunion X) Y))))))))))) % FOF formula (binintersectEL->(binintersectER->(demorgan2b2->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y))))))))))))) of role conjecture named demorgan2b % Conjecture to prove = (binintersectEL->(binintersectER->(demorgan2b2->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y))))))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(binintersectEL->(binintersectER->(demorgan2b2->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y)))))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter binunion:(fofType->(fofType->fofType)). % Parameter binintersect:(fofType->(fofType->fofType)). % Definition binintersectEL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) A))):Prop. % Definition binintersectER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) B))):Prop. % Parameter setminus:(fofType->(fofType->fofType)). % Definition demorgan2b2:=(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) Y))->((in Xx) ((setminus A) ((binunion X) Y))))))))))):Prop. % Trying to prove (binintersectEL->(binintersectER->(demorgan2b2->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y))))))))))))) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x3:((in Y) (powerset A)) % Found x3 as proof of ((in Y) (powerset A)) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x3:((in Y) (powerset A)) % Found x3 as proof of ((in Y) (powerset A)) % Found x3:((in Y) (powerset A)) % Found x3 as proof of ((in Y) (powerset A)) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x3:((in Y) (powerset A)) % Found x3 as proof of ((in Y) (powerset A)) % Found x2:((in X) (powerset A)) % Found x2 as proof of ((in X) (powerset A)) % Found x6000:=(x600 x5):((in Xx) ((setminus A) X)) % Found (x600 x5) as proof of ((in Xx) ((setminus A) X)) % Found ((x60 ((setminus A) Y)) x5) as proof of ((in Xx) ((setminus A) X)) % Found (((fun (B:fofType)=> ((x6 B) Xx)) ((setminus A) Y)) x5) as proof of ((in Xx) ((setminus A) X)) % Found (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5) as proof of ((in Xx) ((setminus A) X)) % Found (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5) as proof of ((in Xx) ((setminus A) X)) % Found x00000:=(x0000 x5):((in Xx) ((setminus A) Y)) % Found (x0000 x5) as proof of ((in Xx) ((setminus A) Y)) % Found ((x000 ((setminus A) X)) x5) as proof of ((in Xx) ((setminus A) Y)) % Found (((fun (A0:fofType)=> ((x00 A0) Xx)) ((setminus A) X)) x5) as proof of ((in Xx) ((setminus A) Y)) % Found (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5) as proof of ((in Xx) ((setminus A) Y)) % Found (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5) as proof of ((in Xx) ((setminus A) Y)) % Found (((x1000000 x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5)) as proof of ((in Xx) ((setminus A) ((binunion X) Y))) % Found ((((x100000 Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5)) as proof of ((in Xx) ((setminus A) ((binunion X) Y))) % Found (((((x10000 x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5)) as proof of ((in Xx) ((setminus A) ((binunion X) Y))) % Found ((((((x1000 Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5)) as proof of ((in Xx) ((setminus A) ((binunion X) Y))) % Found (((((((x100 x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5)) as proof of ((in Xx) ((setminus A) ((binunion X) Y))) % Found ((((((((x10 X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5)) as proof of ((in Xx) ((setminus A) ((binunion X) Y))) % Found (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5)) as proof of ((in Xx) ((setminus A) ((binunion X) Y))) % Found (fun (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of ((in Xx) ((setminus A) ((binunion X) Y))) % Found (fun (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y)))) % Found (fun (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y))))) % Found (fun (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y)))))) % Found (fun (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y))))))) % Found (fun (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y)))))))) % Found (fun (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y))))))))) % Found (fun (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) 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) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y)))))))))) % Found (fun (x1:demorgan2b2) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) 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) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y)))))))))) % Found (fun (x0:binintersectER) (x1:demorgan2b2) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (demorgan2b2->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y))))))))))) % Found (fun (x:binintersectEL) (x0:binintersectER) (x1:demorgan2b2) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (binintersectER->(demorgan2b2->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y)))))))))))) % Found (fun (x:binintersectEL) (x0:binintersectER) (x1:demorgan2b2) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) as proof of (binintersectEL->(binintersectER->(demorgan2b2->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y)))->((in Xx) ((setminus A) ((binunion X) Y))))))))))))) % Got proof (fun (x:binintersectEL) (x0:binintersectER) (x1:demorgan2b2) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) % Time elapsed = 2.284465s % node=436 cost=778.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:binintersectEL) (x0:binintersectER) (x1:demorgan2b2) (A:fofType) (X:fofType) (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((binintersect ((setminus A) X)) ((setminus A) Y))))=> (((((((((x1 A) X) x2) Y) x3) Xx) x4) (((fun (B:fofType)=> (((x ((setminus A) X)) B) Xx)) ((setminus A) Y)) x5)) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((setminus A) Y))) A0) Xx)) ((setminus A) X)) x5))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------