%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU727^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 : n099.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:56 EDT 2014 % Result : Theorem 0.82s % Output : Proof 0.82s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU727^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n099.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:19:21 CDT 2014 % % CPUTime : 0.82 % 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 0xb36cb0>, <kernel.DependentProduct object at 0xb36908>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xf11050>, <kernel.DependentProduct object at 0xb369e0>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0xb36950>, <kernel.DependentProduct object at 0xb36ea8>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0xb36878>, <kernel.Sort object at 0xa1fe18>) 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 0xa1cf38>, <kernel.Sort object at 0xa1fe18>) 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 (setminusI->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X)))))))))) of role conjecture named doubleComplementI1 % Conjecture to prove = (setminusI->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X)))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setminusI->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(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. % Trying to prove (setminusI->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X)))))))))) % Found x2:((in Xx) A) % Found x2 as proof of ((in Xx) A) % Found x00000:=(x0000 x5):False % Found (x0000 x5) as proof of False % Found ((x000 A) x5) as proof of False % Found (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> (((x00 A0) x6) x3)) A) x5) as proof of False % Found (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5) as proof of False % Found (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)) as proof of False % Found (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)) as proof of (((in Xx) ((setminus A) X))->False) % Found ((x400 x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5))) as proof of ((in Xx) ((setminus A) ((setminus A) X))) % Found (((x40 Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5))) as proof of ((in Xx) ((setminus A) ((setminus A) X))) % Found ((((x4 ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5))) as proof of ((in Xx) ((setminus A) ((setminus A) X))) % Found (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5))) as proof of ((in Xx) ((setminus A) ((setminus A) X))) % Found (fun (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of ((in Xx) ((setminus A) ((setminus A) X))) % Found (fun (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of (((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X)))) % Found (fun (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X))))) % Found (fun (x1:((in X) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X)))))) % Found (fun (X:fofType) (x1:((in X) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X))))))) % Found (fun (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of (forall (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X)))))))) % Found (fun (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X)))))))) % Found (fun (x:setminusI) (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of (setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X))))))))) % Found (fun (x:setminusI) (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) as proof of (setminusI->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->((in Xx) ((setminus A) ((setminus A) X)))))))))) % Got proof (fun (x:setminusI) (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) % Time elapsed = 0.492173s % node=105 cost=661.000000 depth=18 % :::::::::::::::::::::: % % 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) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((in Xx) X))=> (((((x A) ((setminus A) X)) Xx) x2) (fun (x5:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x6:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x0 A0) X) Xx)) A0) x6) x3)) A) x5)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------