%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU908^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 : n104.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:22 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 : SEU908^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n104.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:42: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 0x1f54050>, <kernel.Type object at 0x1f54ab8>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (<kernel.Constant object at 0x19517a0>, <kernel.DependentProduct object at 0x1f54248>) of role type named f % Using role type % Declaring f:(a->a) % FOF formula (forall (Xx:a), ((forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))->(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp (f Xx)))))) of role conjecture named cTHM527_pme % Conjecture to prove = (forall (Xx:a), ((forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))->(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp (f Xx)))))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (Xx:a), ((forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))->(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp (f Xx))))))'] % Parameter a:Type. % Parameter f:(a->a). % Trying to prove (forall (Xx:a), ((forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))->(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp (f Xx)))))) % Found x00:=(x0 (f Xx0)):((Xp (f Xx0))->(Xp (f (f Xx0)))) % Found (x0 (f Xx0)) as proof of ((Xp (f Xx0))->(Xp (f (f Xx0)))) % Found (fun (Xx0:a)=> (x0 (f Xx0))) as proof of ((Xp (f Xx0))->(Xp (f (f Xx0)))) % Found (fun (Xx0:a)=> (x0 (f Xx0))) as proof of (forall (Xx0:a), ((Xp (f Xx0))->(Xp (f (f Xx0))))) % Found (x1 (fun (Xx0:a)=> (x0 (f Xx0)))) as proof of (Xp (f Xx)) % Found ((x (fun (x2:a)=> (Xp (f x2)))) (fun (Xx0:a)=> (x0 (f Xx0)))) as proof of (Xp (f Xx)) % Found (fun (x0:(forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0)))))=> ((x (fun (x2:a)=> (Xp (f x2)))) (fun (Xx0:a)=> (x0 (f Xx0))))) as proof of (Xp (f Xx)) % Found (fun (Xp:(a->Prop)) (x0:(forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0)))))=> ((x (fun (x2:a)=> (Xp (f x2)))) (fun (Xx0:a)=> (x0 (f Xx0))))) as proof of ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp (f Xx))) % Found (fun (x:(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))) (Xp:(a->Prop)) (x0:(forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0)))))=> ((x (fun (x2:a)=> (Xp (f x2)))) (fun (Xx0:a)=> (x0 (f Xx0))))) as proof of (forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp (f Xx)))) % Found (fun (Xx:a) (x:(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))) (Xp:(a->Prop)) (x0:(forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0)))))=> ((x (fun (x2:a)=> (Xp (f x2)))) (fun (Xx0:a)=> (x0 (f Xx0))))) as proof of ((forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))->(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp (f Xx))))) % Found (fun (Xx:a) (x:(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))) (Xp:(a->Prop)) (x0:(forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0)))))=> ((x (fun (x2:a)=> (Xp (f x2)))) (fun (Xx0:a)=> (x0 (f Xx0))))) as proof of (forall (Xx:a), ((forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))->(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp (f Xx)))))) % Got proof (fun (Xx:a) (x:(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))) (Xp:(a->Prop)) (x0:(forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0)))))=> ((x (fun (x2:a)=> (Xp (f x2)))) (fun (Xx0:a)=> (x0 (f Xx0))))) % Time elapsed = 0.120547s % node=30 cost=-28.000000 depth=9 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (Xx:a) (x:(forall (Xp:(a->Prop)), ((forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0))))->(Xp Xx)))) (Xp:(a->Prop)) (x0:(forall (Xx0:a), ((Xp Xx0)->(Xp (f Xx0)))))=> ((x (fun (x2:a)=> (Xp (f x2)))) (fun (Xx0:a)=> (x0 (f Xx0))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------