%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEV131^5 : TPTP v6.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n089.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:47 EDT 2014 % Result : Theorem 0.41s % Output : Proof 0.41s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEV131^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n089.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 08:11:31 CDT 2014 % % CPUTime : 0.41 % 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 0x2541d40>, <kernel.Type object at 0x2541998>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy)))))) of role conjecture named cTHM202_pme % Conjecture to prove = (forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy)))))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy))))))'] % Parameter a:Type. % Trying to prove (forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy)))))) % Found x:((Xr Xx) Xy) % Instantiate: Xy0:=Xx:a % Found x as proof of ((Xr Xy0) Xy) % Found x1:(Xx0 Xx) % Instantiate: Xy0:=Xx:a % Found x1 as proof of (Xx0 Xy0) % Found ((conj00 x) x1) as proof of ((and ((Xr Xy0) Xy)) (Xx0 Xy0)) % Found (((conj0 (Xx0 Xy0)) x) x1) as proof of ((and ((Xr Xy0) Xy)) (Xx0 Xy0)) % Found ((((conj ((Xr Xy0) Xy)) (Xx0 Xy0)) x) x1) as proof of ((and ((Xr Xy0) Xy)) (Xx0 Xy0)) % Found ((((conj ((Xr Xy0) Xy)) (Xx0 Xy0)) x) x1) as proof of ((and ((Xr Xy0) Xy)) (Xx0 Xy0)) % Found (x000 ((((conj ((Xr Xy0) Xy)) (Xx0 Xy0)) x) x1)) as proof of (Xx0 Xy) % Found ((x00 Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1)) as proof of (Xx0 Xy) % Found (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1)) as proof of (Xx0 Xy) % Found (fun (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) as proof of (Xx0 Xy) % Found (fun (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) as proof of ((Xx0 Xx)->(Xx0 Xy)) % Found (fun (Xx0:(a->Prop)) (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) as proof of ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy))) % Found (fun (x:((Xr Xx) Xy)) (Xx0:(a->Prop)) (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) as proof of (forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy)))) % Found (fun (Xy:a) (x:((Xr Xx) Xy)) (Xx0:(a->Prop)) (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) as proof of (((Xr Xx) Xy)->(forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy))))) % Found (fun (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xx0:(a->Prop)) (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) as proof of (forall (Xy:a), (((Xr Xx) Xy)->(forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy)))))) % Found (fun (Xr:(a->(a->Prop))) (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xx0:(a->Prop)) (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) as proof of (forall (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy)))))) % Found (fun (Xr:(a->(a->Prop))) (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xx0:(a->Prop)) (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) as proof of (forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xx0:(a->Prop)), ((forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))->((Xx0 Xx)->(Xx0 Xy)))))) % Got proof (fun (Xr:(a->(a->Prop))) (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xx0:(a->Prop)) (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) % Time elapsed = 0.105930s % node=16 cost=414.000000 depth=15 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (Xr:(a->(a->Prop))) (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xx0:(a->Prop)) (x0:(forall (Xy0:a) (Xz:a), (((and ((Xr Xy0) Xz)) (Xx0 Xy0))->(Xx0 Xz)))) (x1:(Xx0 Xx))=> (((fun (Xy0:a)=> ((x0 Xy0) Xy)) Xx) ((((conj ((Xr Xx) Xy)) (Xx0 Xx)) x) x1))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------