%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SET590^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 : n097.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:46 EDT 2014 % Result : Theorem 0.39s % Output : Proof 0.39s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SET590^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n097.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:13:11 CDT 2014 % % CPUTime : 0.39 % 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 0x2411ef0>, <kernel.Type object at 0x2411e60>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), (((and (X Xx)) ((Y Xx)->False))->(X Xx))) of role conjecture named cBOOL_PROP_49_pme % Conjecture to prove = (forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), (((and (X Xx)) ((Y Xx)->False))->(X Xx))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), (((and (X Xx)) ((Y Xx)->False))->(X Xx)))'] % Parameter a:Type. % Trying to prove (forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), (((and (X Xx)) ((Y Xx)->False))->(X Xx))) % Found x0:(X Xx) % Found (fun (x1:((Y Xx)->False))=> x0) as proof of (X Xx) % Found (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0) as proof of (((Y Xx)->False)->(X Xx)) % Found (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0) as proof of ((X Xx)->(((Y Xx)->False)->(X Xx))) % Found (and_rect00 (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0)) as proof of (X Xx) % Found ((and_rect0 (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0)) as proof of (X Xx) % Found (((fun (P:Type) (x0:((X Xx)->(((Y Xx)->False)->P)))=> (((((and_rect (X Xx)) ((Y Xx)->False)) P) x0) x)) (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0)) as proof of (X Xx) % Found (fun (x:((and (X Xx)) ((Y Xx)->False)))=> (((fun (P:Type) (x0:((X Xx)->(((Y Xx)->False)->P)))=> (((((and_rect (X Xx)) ((Y Xx)->False)) P) x0) x)) (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0))) as proof of (X Xx) % Found (fun (Xx:a) (x:((and (X Xx)) ((Y Xx)->False)))=> (((fun (P:Type) (x0:((X Xx)->(((Y Xx)->False)->P)))=> (((((and_rect (X Xx)) ((Y Xx)->False)) P) x0) x)) (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0))) as proof of (((and (X Xx)) ((Y Xx)->False))->(X Xx)) % Found (fun (Y:(a->Prop)) (Xx:a) (x:((and (X Xx)) ((Y Xx)->False)))=> (((fun (P:Type) (x0:((X Xx)->(((Y Xx)->False)->P)))=> (((((and_rect (X Xx)) ((Y Xx)->False)) P) x0) x)) (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0))) as proof of (forall (Xx:a), (((and (X Xx)) ((Y Xx)->False))->(X Xx))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Xx:a) (x:((and (X Xx)) ((Y Xx)->False)))=> (((fun (P:Type) (x0:((X Xx)->(((Y Xx)->False)->P)))=> (((((and_rect (X Xx)) ((Y Xx)->False)) P) x0) x)) (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0))) as proof of (forall (Y:(a->Prop)) (Xx:a), (((and (X Xx)) ((Y Xx)->False))->(X Xx))) % Found (fun (X:(a->Prop)) (Y:(a->Prop)) (Xx:a) (x:((and (X Xx)) ((Y Xx)->False)))=> (((fun (P:Type) (x0:((X Xx)->(((Y Xx)->False)->P)))=> (((((and_rect (X Xx)) ((Y Xx)->False)) P) x0) x)) (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0))) as proof of (forall (X:(a->Prop)) (Y:(a->Prop)) (Xx:a), (((and (X Xx)) ((Y Xx)->False))->(X Xx))) % Got proof (fun (X:(a->Prop)) (Y:(a->Prop)) (Xx:a) (x:((and (X Xx)) ((Y Xx)->False)))=> (((fun (P:Type) (x0:((X Xx)->(((Y Xx)->False)->P)))=> (((((and_rect (X Xx)) ((Y Xx)->False)) P) x0) x)) (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0))) % Time elapsed = 0.080735s % node=17 cost=90.000000 depth=10 % :::::::::::::::::::::: % % 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)) (Xx:a) (x:((and (X Xx)) ((Y Xx)->False)))=> (((fun (P:Type) (x0:((X Xx)->(((Y Xx)->False)->P)))=> (((((and_rect (X Xx)) ((Y Xx)->False)) P) x0) x)) (X Xx)) (fun (x0:(X Xx)) (x1:((Y Xx)->False))=> x0))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------