%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU744^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:32:59 EDT 2014 % Result : Theorem 8.15s % Output : Proof 8.15s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU744^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:21:31 CDT 2014 % % CPUTime : 8.15 % 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 0x16ba128>, <kernel.DependentProduct object at 0x16ba440>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x169a200>, <kernel.DependentProduct object at 0x16ba518>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x16ba488>, <kernel.DependentProduct object at 0x16ba050>) of role type named binunion_type % Using role type % Declaring binunion:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x16ba830>, <kernel.DependentProduct object at 0x16ba128>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x16ba638>, <kernel.Sort object at 0x11a2ab8>) 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 0x16babd8>, <kernel.Sort object at 0x11a2ab8>) of role type named binunionTILcontra_type % Using role type % Declaring binunionTILcontra:Prop % FOF formula (((eq Prop) binunionTILcontra) (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) X)->False))))))))) of role definition named binunionTILcontra % A new definition: (((eq Prop) binunionTILcontra) (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) X)->False))))))))) % Defined: binunionTILcontra:=(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) X)->False)))))))) % FOF formula (setminusER->(binunionTILcontra->(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) X)->False)))))))))) of role conjecture named inComplementUnionImpNotIn1 % Conjecture to prove = (setminusER->(binunionTILcontra->(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) X)->False)))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setminusER->(binunionTILcontra->(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) X)->False))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter binunion:(fofType->(fofType->fofType)). % Parameter setminus:(fofType->(fofType->fofType)). % Definition setminusER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False))):Prop. % Definition binunionTILcontra:=(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) X)->False)))))))):Prop. % Trying to prove (setminusER->(binunionTILcontra->(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) X)->False)))))))))) % Found x2:((in Y) (powerset A)) % Found x2 as proof of ((in Y) (powerset A)) % Found x1:((in X) (powerset A)) % Found x1 as proof of ((in X) (powerset A)) % Found x2:((in Y) (powerset A)) % Found x2 as proof of ((in Y) (powerset A)) % Found x1:((in X) (powerset A)) % Found x1 as proof of ((in X) (powerset A)) % Found x2:((in Y) (powerset A)) % Found x2 as proof of ((in Y) (powerset A)) % Found x1:((in X) (powerset A)) % Found x1 as proof of ((in X) (powerset A)) % Found x2:((in Y) (powerset A)) % Found x2 as proof of ((in Y) (powerset A)) % Found x1:((in X) (powerset A)) % Found x1 as proof of ((in X) (powerset A)) % Found x5000:=(x500 x4):(((in Xx) ((binunion X) Y))->False) % Found (x500 x4) as proof of (((in Xx) ((binunion X) Y))->False) % Found ((x50 A) x4) as proof of (((in Xx) ((binunion X) Y))->False) % Found (((fun (A0:fofType)=> ((x5 A0) Xx)) A) x4) as proof of (((in Xx) ((binunion X) Y))->False) % Found (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4) as proof of (((in Xx) ((binunion X) Y))->False) % Found (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4) as proof of (((in Xx) ((binunion X) Y))->False) % Found ((x0000000 x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4)) as proof of (((in Xx) X)->False) % Found (((x000000 Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4)) as proof of (((in Xx) X)->False) % Found ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> (((x00000 Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4)) as proof of (((in Xx) X)->False) % Found ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((x0000 x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4)) as proof of (((in Xx) X)->False) % Found ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> (((((x000 A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4)) as proof of (((in Xx) X)->False) % Found ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> (((((x00 A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4)) as proof of (((in Xx) X)->False) % Found ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4)) as proof of (((in Xx) X)->False) % Found (fun (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) as proof of (((in Xx) X)->False) % Found (fun (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) as proof of (((in Xx) ((setminus A) ((binunion X) Y)))->(((in Xx) X)->False)) % Found (fun (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) as proof of (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->(((in Xx) X)->False))) % Found (fun (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->(((in Xx) X)->False)))) % Found (fun (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) as proof of (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->(((in Xx) X)->False))))) % 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) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) 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) X)->False)))))) % 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) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) 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) ((binunion X) Y)))->(((in Xx) X)->False))))))) % 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) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) 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) ((binunion X) Y)))->(((in Xx) X)->False)))))))) % Found (fun (x0:binunionTILcontra) (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) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) 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) ((binunion X) Y)))->(((in Xx) X)->False)))))))) % Found (fun (x:setminusER) (x0:binunionTILcontra) (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) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) as proof of (binunionTILcontra->(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) X)->False))))))))) % Found (fun (x:setminusER) (x0:binunionTILcontra) (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) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) as proof of (setminusER->(binunionTILcontra->(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) X)->False)))))))))) % Got proof (fun (x:setminusER) (x0:binunionTILcontra) (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) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) % Time elapsed = 7.761280s % node=1550 cost=1388.000000 depth=22 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setminusER) (x0:binunionTILcontra) (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) ((binunion X) Y))))=> ((((fun (Y0:fofType) (x6:((in Y0) (powerset A)))=> ((((((fun (A0:fofType) (x5:((in X) (powerset A0))) (Y0:fofType) (x6:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x5) Y0) x6) Xx)) A) x1) Y0) x6) x3)) Y) x2) (((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) ((binunion X) Y))) A0) Xx)) A) x4))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------