%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU538^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:32:24 EDT 2014 % Result : Theorem 0.57s % Output : Proof 0.57s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU538^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 10:34:26 CDT 2014 % % CPUTime : 0.57 % 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 0x21ab710>, <kernel.DependentProduct object at 0x218c1b8>) of role type named in % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (forall (A:fofType) (Xphi:(fofType->Prop)), ((((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)->(forall (Xx:fofType), (((in Xx) A)->((Xphi Xx)->False))))) of role conjecture named quantDeMorgan3 % Conjecture to prove = (forall (A:fofType) (Xphi:(fofType->Prop)), ((((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)->(forall (Xx:fofType), (((in Xx) A)->((Xphi Xx)->False))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(forall (A:fofType) (Xphi:(fofType->Prop)), ((((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)->(forall (Xx:fofType), (((in Xx) A)->((Xphi Xx)->False)))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Trying to prove (forall (A:fofType) (Xphi:(fofType->Prop)), ((((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)->(forall (Xx:fofType), (((in Xx) A)->((Xphi Xx)->False))))) % Found x0:((in Xx) A) % Instantiate: x2:=Xx:fofType % Found x0 as proof of ((in x2) A) % Found x1:(Xphi Xx) % Instantiate: x2:=Xx:fofType % Found x1 as proof of (Xphi x2) % Found ((conj00 x0) x1) as proof of ((and ((in x2) A)) (Xphi x2)) % Found (((conj0 (Xphi x2)) x0) x1) as proof of ((and ((in x2) A)) (Xphi x2)) % Found ((((conj ((in x2) A)) (Xphi x2)) x0) x1) as proof of ((and ((in x2) A)) (Xphi x2)) % Found ((((conj ((in x2) A)) (Xphi x2)) x0) x1) as proof of ((and ((in x2) A)) (Xphi x2)) % Found (ex_intro000 ((((conj ((in x2) A)) (Xphi x2)) x0) x1)) as proof of ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) % Found ((ex_intro00 Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)) as proof of ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) % Found (((ex_intro0 (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)) as proof of ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) % Found ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)) as proof of ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) % Found ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)) as proof of ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) % Found (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1))) as proof of False % Found (fun (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) as proof of False % Found (fun (x0:((in Xx) A)) (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) as proof of ((Xphi Xx)->False) % Found (fun (Xx:fofType) (x0:((in Xx) A)) (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) as proof of (((in Xx) A)->((Xphi Xx)->False)) % Found (fun (x:(((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)) (Xx:fofType) (x0:((in Xx) A)) (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) as proof of (forall (Xx:fofType), (((in Xx) A)->((Xphi Xx)->False))) % Found (fun (Xphi:(fofType->Prop)) (x:(((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)) (Xx:fofType) (x0:((in Xx) A)) (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) as proof of ((((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)->(forall (Xx:fofType), (((in Xx) A)->((Xphi Xx)->False)))) % Found (fun (A:fofType) (Xphi:(fofType->Prop)) (x:(((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)) (Xx:fofType) (x0:((in Xx) A)) (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) as proof of (forall (Xphi:(fofType->Prop)), ((((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)->(forall (Xx:fofType), (((in Xx) A)->((Xphi Xx)->False))))) % Found (fun (A:fofType) (Xphi:(fofType->Prop)) (x:(((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)) (Xx:fofType) (x0:((in Xx) A)) (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) as proof of (forall (A:fofType) (Xphi:(fofType->Prop)), ((((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)->(forall (Xx:fofType), (((in Xx) A)->((Xphi Xx)->False))))) % Got proof (fun (A:fofType) (Xphi:(fofType->Prop)) (x:(((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)) (Xx:fofType) (x0:((in Xx) A)) (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) % Time elapsed = 0.259589s % node=37 cost=449.000000 depth=17 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (A:fofType) (Xphi:(fofType->Prop)) (x:(((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx))))->False)) (Xx:fofType) (x0:((in Xx) A)) (x1:(Xphi Xx))=> (x ((((ex_intro fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (Xphi Xx)))) Xx) ((((conj ((in Xx) A)) (Xphi Xx)) x0) x1)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------