%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SET199^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 : n095.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:30:22 EDT 2014 % Result : Theorem 0.63s % Output : Proof 0.63s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SET199^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n095.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 09:23:56 CDT 2014 % % CPUTime : 0.63 % 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 0x1c340e0>, <kernel.Type object at 0x1c91878>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))->(forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx)))))) of role conjecture named cBOOL_PROP_39_pme % Conjecture to prove = (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))->(forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx)))))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))->(forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx))))))'] % Parameter a:Type. % Trying to prove (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))->(forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx)))))) % Found x200:=(x20 x0):(Y Xx) % Found (x20 x0) as proof of (Y Xx) % Found ((x2 Xx) x0) as proof of (Y Xx) % Found ((x2 Xx) x0) as proof of (Y Xx) % Found (or_intror00 ((x2 Xx) x0)) as proof of ((or (X Xx)) (Y Xx)) % Found ((or_intror0 (Y Xx)) ((x2 Xx) x0)) as proof of ((or (X Xx)) (Y Xx)) % Found (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0)) as proof of ((or (X Xx)) (Y Xx)) % Found (fun (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))) as proof of ((or (X Xx)) (Y Xx)) % Found (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))) as proof of ((forall (Xx0:a), ((Z Xx0)->(Y Xx0)))->((or (X Xx)) (Y Xx))) % Found (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))) as proof of ((forall (Xx0:a), ((Z Xx0)->(X Xx0)))->((forall (Xx0:a), ((Z Xx0)->(Y Xx0)))->((or (X Xx)) (Y Xx)))) % Found (and_rect00 (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0)))) as proof of ((or (X Xx)) (Y Xx)) % Found ((and_rect0 ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0)))) as proof of ((or (X Xx)) (Y Xx)) % Found (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0)))) as proof of ((or (X Xx)) (Y Xx)) % Found (fun (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) as proof of ((or (X Xx)) (Y Xx)) % Found (fun (Xx:a) (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) as proof of ((Z Xx)->((or (X Xx)) (Y Xx))) % Found (fun (x:((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))) (Xx:a) (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) as proof of (forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx)))) % Found (fun (Z:(a->Prop)) (x:((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))) (Xx:a) (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) as proof of (((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))->(forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx))))) % Found (fun (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))) (Xx:a) (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) as proof of (forall (Z:(a->Prop)), (((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))->(forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx)))))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))) (Xx:a) (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) as proof of (forall (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))->(forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx)))))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))) (Xx:a) (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) as proof of (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))->(forall (Xx:a), ((Z Xx)->((or (X Xx)) (Y Xx)))))) % Got proof (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))) (Xx:a) (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) % Time elapsed = 0.315455s % node=74 cost=351.000000 depth=18 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:((and (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx))))) (Xx:a) (x0:(Z Xx))=> (((fun (P:Type) (x1:((forall (Xx:a), ((Z Xx)->(X Xx)))->((forall (Xx:a), ((Z Xx)->(Y Xx)))->P)))=> (((((and_rect (forall (Xx:a), ((Z Xx)->(X Xx)))) (forall (Xx:a), ((Z Xx)->(Y Xx)))) P) x1) x)) ((or (X Xx)) (Y Xx))) (fun (x1:(forall (Xx0:a), ((Z Xx0)->(X Xx0)))) (x2:(forall (Xx0:a), ((Z Xx0)->(Y Xx0))))=> (((or_intror (X Xx)) (Y Xx)) ((x2 Xx) x0))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------