%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU745^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 : n095.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 0.99s % Output : Proof 0.99s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU745^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n095.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:46 CDT 2014 % % CPUTime : 0.99 % 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 0x143ae60>, <kernel.DependentProduct object at 0x143a4d0>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x186b3b0>, <kernel.DependentProduct object at 0x143ad40>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x143ab00>, <kernel.DependentProduct object at 0x143a3b0>) of role type named binunion_type % Using role type % Declaring binunion:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x143a5f0>, <kernel.DependentProduct object at 0x143ae60>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x143aef0>, <kernel.Sort object at 0x1304098>) 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 0x143acf8>, <kernel.Sort object at 0x1304098>) of role type named inComplementUnionImpNotIn1_type % Using role type % Declaring inComplementUnionImpNotIn1:Prop % FOF formula (((eq Prop) inComplementUnionImpNotIn1) (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 definition named inComplementUnionImpNotIn1 % A new definition: (((eq Prop) inComplementUnionImpNotIn1) (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))))))))) % Defined: inComplementUnionImpNotIn1:=(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)))))))) % FOF formula (setminusI->(inComplementUnionImpNotIn1->(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) X))))))))))) of role conjecture named inComplementUnionImpInComplement1 % Conjecture to prove = (setminusI->(inComplementUnionImpNotIn1->(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) X))))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setminusI->(inComplementUnionImpNotIn1->(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) X)))))))))))'] % 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 inComplementUnionImpNotIn1:=(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. % Trying to prove (setminusI->(inComplementUnionImpNotIn1->(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) X))))))))))) % Found x3:((in Xx) A) % Found x3 as proof of ((in Xx) A) % Found x00000000:=(x0000000 x4):(((in Xx) X)->False) % Found (x0000000 x4) as proof of (((in Xx) X)->False) % Found ((x000000 x3) x4) as proof of (((in Xx) X)->False) % Found (((x00000 x2) x3) x4) as proof of (((in Xx) X)->False) % Found ((((x0000 x1) x2) x3) x4) as proof of (((in Xx) X)->False) % Found (((((fun (x6:((in X) (powerset A)))=> (((x000 A) x6) Y)) x1) x2) x3) x4) as proof of (((in Xx) X)->False) % Found (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> (((((x00 A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4) as proof of (((in Xx) X)->False) % Found (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4) as proof of (((in Xx) X)->False) % Found (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4) as proof of (((in Xx) X)->False) % Found ((x500 x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4)) as proof of ((in Xx) ((setminus A) X)) % Found (((x50 Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4)) as proof of ((in Xx) ((setminus A) X)) % Found ((((x5 X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4)) as proof of ((in Xx) ((setminus A) X)) % Found (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4)) as proof of ((in Xx) ((setminus A) X)) % Found (fun (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) as proof of ((in Xx) ((setminus A) X)) % Found (fun (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) as proof of (((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) X))) % Found (fun (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) as proof of (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) X)))) % Found (fun (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) X))))) % Found (fun (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((in Xx) ((setminus A) ((binunion X) Y))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) as proof of (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) ((setminus A) ((binunion X) Y)))->((in Xx) ((setminus A) X)))))) % 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))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) 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) ((setminus A) X))))))) % 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))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) 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) ((binunion X) Y)))->((in Xx) ((setminus A) X)))))))) % 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))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) 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) ((binunion X) Y)))->((in Xx) ((setminus A) X))))))))) % Found (fun (x0:inComplementUnionImpNotIn1) (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))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) 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) ((binunion X) Y)))->((in Xx) ((setminus A) X))))))))) % Found (fun (x:setminusI) (x0:inComplementUnionImpNotIn1) (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))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) as proof of (inComplementUnionImpNotIn1->(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) X)))))))))) % Found (fun (x:setminusI) (x0:inComplementUnionImpNotIn1) (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))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) as proof of (setminusI->(inComplementUnionImpNotIn1->(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) X))))))))))) % Got proof (fun (x:setminusI) (x0:inComplementUnionImpNotIn1) (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))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) % Time elapsed = 0.659064s % node=88 cost=755.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:setminusI) (x0:inComplementUnionImpNotIn1) (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))))=> (((((x A) X) Xx) x3) (((((fun (x6:((in X) (powerset A)))=> ((((fun (A0:fofType) (x6:((in X) (powerset A0))) (Y0:fofType) (x7:((in Y0) (powerset A0)))=> ((((((fun (A0:fofType)=> ((x0 A0) X)) A0) x6) Y0) x7) Xx)) A) x6) Y)) x1) x2) x3) x4))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------