%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SET634^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 : n105.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:54 EDT 2014 % Result : Theorem 0.51s % Output : Proof 0.51s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SET634^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n105.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:28:11 CDT 2014 % % CPUTime : 0.51 % 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 0x22fd758>, <kernel.Type object at 0x22fdcf8>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) of role conjecture named cBOOL_PROP_116_pme % Conjecture to prove = (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))))'] % Parameter a:Type. % Trying to prove (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) % Found eta_expansion000:=(eta_expansion00 (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))):(((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (x:a)=> ((and ((and (X x)) (Y x))) ((Z x)->False)))) % Found (eta_expansion00 (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) as proof of (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) % Found ((eta_expansion0 Prop) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) as proof of (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) % Found (((eta_expansion a) Prop) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) as proof of (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) % Found (fun (Z:(a->Prop))=> (((eta_expansion a) Prop) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) as proof of (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) % Found (fun (Y:(a->Prop)) (Z:(a->Prop))=> (((eta_expansion a) Prop) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) as proof of (forall (Z:(a->Prop)), (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop))=> (((eta_expansion a) Prop) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) as proof of (forall (Y:(a->Prop)) (Z:(a->Prop)), (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop))=> (((eta_expansion a) Prop) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) as proof of (forall (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop)), (((eq (a->Prop)) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False)))) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) % Got proof (fun (X:(a->Prop)) (Y:(a->Prop)) (Z:(a->Prop))=> (((eta_expansion a) Prop) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) % Time elapsed = 0.202695s % node=15 cost=-264.000000 depth=6 % :::::::::::::::::::::: % % 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))=> (((eta_expansion a) Prop) (fun (Xx:a)=> ((and ((and (X Xx)) (Y Xx))) ((Z Xx)->False))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------