%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU858^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:33:17 EDT 2014 % Result : Theorem 0.49s % Output : Proof 0.49s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU858^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 11:37:16 CDT 2014 % % CPUTime : 0.49 % 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 0xe58b00>, <kernel.Type object at 0xe58cf8>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (Xw:((a->Prop)->Prop)), (((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))->(Xw (fun (Xx:a)=> False)))) of role conjecture named cTHM163_pme % Conjecture to prove = (forall (Xw:((a->Prop)->Prop)), (((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))->(Xw (fun (Xx:a)=> False)))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (Xw:((a->Prop)->Prop)), (((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))->(Xw (fun (Xx:a)=> False))))'] % Parameter a:Type. % Trying to prove (forall (Xw:((a->Prop)->Prop)), (((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))->(Xw (fun (Xx:a)=> False)))) % Found x0:(Xw (fun (Xx:a)=> False)) % Found (fun (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0) as proof of (Xw (fun (Xx:a)=> False)) % Found (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0) as proof of ((forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))->(Xw (fun (Xx:a)=> False))) % Found (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0) as proof of ((Xw (fun (Xx:a)=> False))->((forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))->(Xw (fun (Xx:a)=> False)))) % Found (and_rect00 (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0)) as proof of (Xw (fun (Xx:a)=> False)) % Found ((and_rect0 (Xw (fun (Xx:a)=> False))) (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0)) as proof of (Xw (fun (Xx:a)=> False)) % Found (((fun (P:Type) (x0:((Xw (fun (Xx:a)=> False))->((forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))->P)))=> (((((and_rect (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))) P) x0) x)) (Xw (fun (Xx:a)=> False))) (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0)) as proof of (Xw (fun (Xx:a)=> False)) % Found (fun (x:((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))))=> (((fun (P:Type) (x0:((Xw (fun (Xx:a)=> False))->((forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))->P)))=> (((((and_rect (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))) P) x0) x)) (Xw (fun (Xx:a)=> False))) (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0))) as proof of (Xw (fun (Xx:a)=> False)) % Found (fun (Xw:((a->Prop)->Prop)) (x:((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))))=> (((fun (P:Type) (x0:((Xw (fun (Xx:a)=> False))->((forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))->P)))=> (((((and_rect (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))) P) x0) x)) (Xw (fun (Xx:a)=> False))) (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0))) as proof of (((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))->(Xw (fun (Xx:a)=> False))) % Found (fun (Xw:((a->Prop)->Prop)) (x:((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))))=> (((fun (P:Type) (x0:((Xw (fun (Xx:a)=> False))->((forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))->P)))=> (((((and_rect (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))) P) x0) x)) (Xw (fun (Xx:a)=> False))) (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0))) as proof of (forall (Xw:((a->Prop)->Prop)), (((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))->(Xw (fun (Xx:a)=> False)))) % Got proof (fun (Xw:((a->Prop)->Prop)) (x:((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))))=> (((fun (P:Type) (x0:((Xw (fun (Xx:a)=> False))->((forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))->P)))=> (((((and_rect (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))) P) x0) x)) (Xw (fun (Xx:a)=> False))) (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0))) % Time elapsed = 0.181244s % node=15 cost=75.000000 depth=8 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (Xw:((a->Prop)->Prop)) (x:((and (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))))=> (((fun (P:Type) (x0:((Xw (fun (Xx:a)=> False))->((forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))->P)))=> (((((and_rect (Xw (fun (Xx:a)=> False))) (forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx))))))) P) x0) x)) (Xw (fun (Xx:a)=> False))) (fun (x0:(Xw (fun (Xx:a)=> False))) (x1:(forall (Xr:(a->Prop)) (Xx:a), ((Xw Xr)->(Xw (fun (Xt:a)=> ((or (Xr Xt)) (((eq a) Xt) Xx)))))))=> x0))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------