%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEV135^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 : n098.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.44s % Output : Proof 0.44s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEV135^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n098.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:12:16 CDT 2014 % % CPUTime : 0.44 % 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 0x119aea8>, <kernel.Type object at 0x119a4d0>) 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 (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy))))) of role conjecture named cTHM151_pme % Conjecture to prove = (forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy))))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy)))))'] % Parameter a:Type. % Trying to prove (forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy))))) % Found x100:=(x10 x):(Xq Xy) % Found (x10 x) as proof of (Xq Xy) % Found ((x1 Xy) x) as proof of (Xq Xy) % Found (fun (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)) as proof of (Xq Xy) % Found (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)) as proof of ((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->(Xq Xy)) % Found (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)) as proof of ((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->(Xq Xy))) % Found (and_rect00 (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x))) as proof of (Xq Xy) % Found ((and_rect0 (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x))) as proof of (Xq Xy) % Found (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x))) as proof of (Xq Xy) % Found (fun (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) as proof of (Xq Xy) % Found (fun (Xq:(a->Prop)) (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) as proof of (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy)) % Found (fun (x:((Xr Xx) Xy)) (Xq:(a->Prop)) (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) as proof of (forall (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy))) % Found (fun (Xy:a) (x:((Xr Xx) Xy)) (Xq:(a->Prop)) (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) as proof of (((Xr Xx) Xy)->(forall (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy)))) % Found (fun (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xq:(a->Prop)) (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) as proof of (forall (Xy:a), (((Xr Xx) Xy)->(forall (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy))))) % Found (fun (Xr:(a->(a->Prop))) (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xq:(a->Prop)) (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) as proof of (forall (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy))))) % Found (fun (Xr:(a->(a->Prop))) (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xq:(a->Prop)) (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) as proof of (forall (Xr:(a->(a->Prop))) (Xx:a) (Xy:a), (((Xr Xx) Xy)->(forall (Xq:(a->Prop)), (((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))->(Xq Xy))))) % Got proof (fun (Xr:(a->(a->Prop))) (Xx:a) (Xy:a) (x:((Xr Xx) Xy)) (Xq:(a->Prop)) (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) % Time elapsed = 0.122787s % node=15 cost=171.000000 depth=14 % :::::::::::::::::::::: % % 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)) (Xq:(a->Prop)) (x0:((and (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))))=> (((fun (P:Type) (x1:((forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))->((forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))->P)))=> (((((and_rect (forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv)))) P) x1) x0)) (Xq Xy)) (fun (x1:(forall (Xw:a), (((Xr Xx) Xw)->(Xq Xw)))) (x2:(forall (Xu:a) (Xv:a), (((and (Xq Xu)) ((Xr Xu) Xv))->(Xq Xv))))=> ((x1 Xy) x)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------