%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU750^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 : n090.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:00 EDT 2014 % Result : Theorem 17.70s % Output : Proof 17.70s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU750^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n090.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:22:16 CDT 2014 % % CPUTime : 17.70 % 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 0xdaae60>, <kernel.DependentProduct object at 0xe08908>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xdaa170>, <kernel.DependentProduct object at 0xe086c8>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0xd8b170>, <kernel.DependentProduct object at 0xe08b48>) of role type named binunion_type % Using role type % Declaring binunion:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0xdaa170>, <kernel.DependentProduct object at 0xe08830>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0xdaa170>, <kernel.Sort object at 0x898998>) 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 0x8923b0>, <kernel.Sort object at 0x898998>) of role type named setminusER_type % Using role type % Declaring setminusER:Prop % FOF formula (((eq Prop) setminusER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False)))) of role definition named setminusER % A new definition: (((eq Prop) setminusER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False)))) % Defined: setminusER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False))) % FOF formula (<kernel.Constant object at 0x89cef0>, <kernel.Sort object at 0x898998>) of role type named binunionTIRcontra_type % Using role type % Declaring binunionTIRcontra:Prop % FOF formula (((eq Prop) binunionTIRcontra) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) Y)->False))))))))) of role definition named binunionTIRcontra % A new definition: (((eq Prop) binunionTIRcontra) (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) Y)->False))))))))) % Defined: binunionTIRcontra:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) Y)->False)))))))) % FOF formula (setminusI->(setminusER->(binunionTIRcontra->(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) ((binunion X) Y)))->((in Xx) ((setminus A) Y)))))))))))) of role conjecture named demorgan2a2 % Conjecture to prove = (setminusI->(setminusER->(binunionTIRcontra->(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) ((binunion X) Y)))->((in Xx) ((setminus A) Y)))))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setminusI->(setminusER->(binunionTIRcontra->(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) ((binunion X) Y)))->((in Xx) ((setminus A) Y))))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter binunion:(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 setminusER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False))):Prop. % Definition binunionTIRcontra:=(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->((((in Xx) ((binunion X) Y))->False)->(((in Xx) Y)->False)))))))):Prop. % Trying to prove (setminusI->(setminusER->(binunionTIRcontra->(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) ((binunion X) Y)))->((in Xx) ((setminus A) 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 x4:((in Xx) A) % Found x4 as proof of ((in Xx) A) % Found x2:((in X) (powerset A)) % Found x2 as proof of ((in X) (powerset 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 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 x2:((in X) (powerset A)) % Found x2 as proof of ((in X) (powerset 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 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 x2:((in X) (powerset A)) % Found x2 as proof of ((in X) (powerset A)) % Found x2:((in X) (powerset A)) % Found x2 as proof of ((in X) (powerset 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 x2:((in X) (powerset A)) % Found x2 as proof of ((in X) (powerset A)) % Found x2:((in X) (powerset A)) % Found x2 as proof of ((in X) (powerset A)) % Found x00000:=(x0000 x5):(((in Xx) ((binunion X) Y))->False) % Found (x0000 x5) as proof of (((in Xx) ((binunion X) Y))->False) % Found ((x000 A) x5) as proof of (((in Xx) ((binunion X) Y))->False) % Found (((fun (A0:fofType)=> ((x00 A0) Xx)) A) x5) as proof of (((in Xx) ((binunion X) Y))->False) % Found (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5) as proof of (((in Xx) ((binunion X) Y))->False) % Found (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5) as proof of (((in Xx) ((binunion X) Y))->False) % Found ((x1000000 x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)) as proof of (((in Xx) Y)->False) % Found (((x100000 X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)) as proof of (((in Xx) Y)->False) % Found ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((x10000 X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)) as proof of (((in Xx) Y)->False) % Found ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((x1000 X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)) as proof of (((in Xx) Y)->False) % Found ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((x100 A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)) as proof of (((in Xx) Y)->False) % Found ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> (((((x10 A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)) as proof of (((in Xx) Y)->False) % Found ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)) as proof of (((in Xx) Y)->False) % Found ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)) as proof of (((in Xx) Y)->False) % Found ((x600 x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5))) as proof of ((in Xx) ((setminus A) Y)) % Found (((x60 Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5))) as proof of ((in Xx) ((setminus A) Y)) % Found ((((x6 Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5))) as proof of ((in Xx) ((setminus A) Y)) % Found (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5))) as proof of ((in Xx) ((setminus A) Y)) % Found (fun (x5:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of ((in Xx) ((setminus A) Y)) % Found (fun (x4:((in Xx) A)) (x5:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) Y))) % Found (fun (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) Y)))) % Found (fun (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) Y))))) % Found (fun (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) Y)))))) % Found (fun (x2:((in X) (powerset A))) (Y:fofType) (x3:((in Y) (powerset A))) (Xx:fofType) (x4:((in Xx) A)) (x5:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) 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) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) 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) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) 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) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) Y))))))))) % Found (fun (x1:binunionTIRcontra) (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) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) 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) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) Y))))))))) % Found (fun (x0:setminusER) (x1:binunionTIRcontra) (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) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (binunionTIRcontra->(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) ((binunion X) Y)))->((in Xx) ((setminus A) Y)))))))))) % Found (fun (x:setminusI) (x0:setminusER) (x1:binunionTIRcontra) (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) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (setminusER->(binunionTIRcontra->(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) ((binunion X) Y)))->((in Xx) ((setminus A) Y))))))))))) % Found (fun (x:setminusI) (x0:setminusER) (x1:binunionTIRcontra) (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) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) as proof of (setminusI->(setminusER->(binunionTIRcontra->(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) ((binunion X) Y)))->((in Xx) ((setminus A) Y)))))))))))) % Got proof (fun (x:setminusI) (x0:setminusER) (x1:binunionTIRcontra) (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) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) % Time elapsed = 17.249896s % node=3217 cost=1584.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:setminusI) (x0:setminusER) (x1:binunionTIRcontra) (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) ((setminus A) ((binunion X) Y))))=> (((((x A) Y) Xx) x4) ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> ((((fun (X0:fofType) (x7:((in X0) (powerset A)))=> (((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0))) (x8:((in Y) (powerset A0)))=> ((((((fun (A0:fofType) (X0:fofType) (x7:((in X0) (powerset A0)))=> ((((x1 A0) X0) x7) Y)) A0) X0) x7) x8) Xx)) A) X0) x7) x3)) X0) x7) x4)) X) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) ((binunion X) Y))) A0) Xx)) A) x5)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------