%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SET584^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 : n190.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:45 EDT 2014 % Result : Theorem 0.56s % Output : Proof 0.56s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SET584^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n190.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 10:12:26 CDT 2014 % % CPUTime : 0.56 % 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 0x278a4d0>, <kernel.Type object at 0x278a3b0>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx)))))) of role conjecture named cBOOL_PROP_33_pme % Conjecture to prove = (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx)))))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx))))))'] % Parameter a:Type. % Trying to prove (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx)))))) % Found or_intror00:=(or_intror0 (Z Xx)):((Z Xx)->((or (Y Xx)) (Z Xx))) % Found (or_intror0 (Z Xx)) as proof of ((Z Xx)->((or (Y Xx)) (Z Xx))) % Found ((or_intror (Y Xx)) (Z Xx)) as proof of ((Z Xx)->((or (Y Xx)) (Z Xx))) % Found ((or_intror (Y Xx)) (Z Xx)) as proof of ((Z Xx)->((or (Y Xx)) (Z Xx))) % Found x20:=(x2 x1):(Y Xx) % Found (x2 x1) as proof of (Y Xx) % Found ((x Xx) x1) as proof of (Y Xx) % Found ((x Xx) x1) as proof of (Y Xx) % Found (or_introl00 ((x Xx) x1)) as proof of ((or (Y Xx)) (Z Xx)) % Found ((or_introl0 (Z Xx)) ((x Xx) x1)) as proof of ((or (Y Xx)) (Z Xx)) % Found (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)) as proof of ((or (Y Xx)) (Z Xx)) % Found (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1))) as proof of ((or (Y Xx)) (Z Xx)) % Found (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1))) as proof of ((X Xx)->((or (Y Xx)) (Z Xx))) % Found ((or_ind00 (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx))) as proof of ((or (Y Xx)) (Z Xx)) % Found (((or_ind0 ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx))) as proof of ((or (Y Xx)) (Z Xx)) % Found ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx))) as proof of ((or (Y Xx)) (Z Xx)) % Found (fun (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) as proof of ((or (Y Xx)) (Z Xx)) % Found (fun (Xx:a) (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) as proof of (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx))) % Found (fun (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) as proof of (forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx)))) % Found (fun (Z:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) as proof of ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx))))) % Found (fun (Y:(a->Prop)) (Z:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) as proof of (forall (Z:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx)))))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) as proof of (forall (Y:(a->Prop)) (Z:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx)))))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) as proof of (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), ((forall (Xx:a), ((X Xx)->(Y Xx)))->(forall (Xx:a), (((or (X Xx)) (Z Xx))->((or (Y Xx)) (Z Xx)))))) % Got proof (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)) (x:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) % Time elapsed = 0.250003s % node=66 cost=312.000000 depth=17 % :::::::::::::::::::::: % % 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:(forall (Xx:a), ((X Xx)->(Y Xx)))) (Xx:a) (x0:((or (X Xx)) (Z Xx)))=> ((((fun (P:Prop) (x1:((X Xx)->P)) (x2:((Z Xx)->P))=> ((((((or_ind (X Xx)) (Z Xx)) P) x1) x2) x0)) ((or (Y Xx)) (Z Xx))) (fun (x1:(X Xx))=> (((or_introl (Y Xx)) (Z Xx)) ((x Xx) x1)))) ((or_intror (Y Xx)) (Z Xx)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------