%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU836^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 : n116.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:15 EDT 2014 % Result : Theorem 0.36s % Output : Proof 0.36s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU836^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n116.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:36:01 CDT 2014 % % CPUTime : 0.36 % 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 0x27315f0>, <kernel.Type object at 0x27317e8>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), ((S Xx)->((or (T Xx)) (S Xx)))) of role conjecture named cGAZING_THM19_pme % Conjecture to prove = (forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), ((S Xx)->((or (T Xx)) (S Xx)))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), ((S Xx)->((or (T Xx)) (S Xx))))'] % Parameter a:Type. % Trying to prove (forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), ((S Xx)->((or (T Xx)) (S Xx)))) % Found or_intror00:=(or_intror0 (S Xx)):((S Xx)->((or (T Xx)) (S Xx))) % Found (or_intror0 (S Xx)) as proof of ((S Xx)->((or (T Xx)) (S Xx))) % Found ((or_intror (T Xx)) (S Xx)) as proof of ((S Xx)->((or (T Xx)) (S Xx))) % Found (fun (Xx:a)=> ((or_intror (T Xx)) (S Xx))) as proof of ((S Xx)->((or (T Xx)) (S Xx))) % Found (fun (T:(a->Prop)) (Xx:a)=> ((or_intror (T Xx)) (S Xx))) as proof of (forall (Xx:a), ((S Xx)->((or (T Xx)) (S Xx)))) % Found (fun (S:(a->Prop)) (T:(a->Prop)) (Xx:a)=> ((or_intror (T Xx)) (S Xx))) as proof of (forall (T:(a->Prop)) (Xx:a), ((S Xx)->((or (T Xx)) (S Xx)))) % Found (fun (S:(a->Prop)) (T:(a->Prop)) (Xx:a)=> ((or_intror (T Xx)) (S Xx))) as proof of (forall (S:(a->Prop)) (T:(a->Prop)) (Xx:a), ((S Xx)->((or (T Xx)) (S Xx)))) % Got proof (fun (S:(a->Prop)) (T:(a->Prop)) (Xx:a)=> ((or_intror (T Xx)) (S Xx))) % Time elapsed = 0.041720s % node=6 cost=-179.000000 depth=5 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (S:(a->Prop)) (T:(a->Prop)) (Xx:a)=> ((or_intror (T Xx)) (S Xx))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------