%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU925^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:33:23 EDT 2014 % Result : Theorem 0.92s % Output : Proof 0.92s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU925^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 11:43:01 CDT 2014 % % CPUTime : 0.92 % Python 2.7.5 % Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/'] % FOF formula (forall (Xx:fofType) (Xy:fofType), ((((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2)))->(((eq fofType) Xx) Xy))) of role conjecture named cTHM7_TPS2_pme % Conjecture to prove = (forall (Xx:fofType) (Xy:fofType), ((((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2)))->(((eq fofType) Xx) Xy))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(forall (Xx:fofType) (Xy:fofType), ((((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2)))->(((eq fofType) Xx) Xy)))'] % Parameter fofType:Type. % Trying to prove (forall (Xx:fofType) (Xy:fofType), ((((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2)))->(((eq fofType) Xx) Xy))) % Found eq_ref00:=(eq_ref0 Xx):(((eq fofType) Xx) Xx) % Found (eq_ref0 Xx) as proof of (((eq fofType) Xx) Xx) % Found ((eq_ref fofType) Xx) as proof of (((eq fofType) Xx) Xx) % Found ((eq_ref fofType) Xx) as proof of (((eq fofType) Xx) Xx) % Found (x0 ((eq_ref fofType) Xx)) as proof of (((eq fofType) Xy) Xx) % Found ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx)) as proof of (((eq fofType) Xy) Xx) % Found ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx)) as proof of (((eq fofType) Xy) Xx) % Found (eq_sym000 ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx))) as proof of (((eq fofType) Xx) Xy) % Found ((eq_sym00 Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx))) as proof of (((eq fofType) Xx) Xy) % Found (((eq_sym0 Xy) Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx))) as proof of (((eq fofType) Xx) Xy) % Found ((((eq_sym fofType) Xy) Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx))) as proof of (((eq fofType) Xx) Xy) % Found (fun (x:(((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2))))=> ((((eq_sym fofType) Xy) Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx)))) as proof of (((eq fofType) Xx) Xy) % Found (fun (Xy:fofType) (x:(((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2))))=> ((((eq_sym fofType) Xy) Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx)))) as proof of ((((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2)))->(((eq fofType) Xx) Xy)) % Found (fun (Xx:fofType) (Xy:fofType) (x:(((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2))))=> ((((eq_sym fofType) Xy) Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx)))) as proof of (forall (Xy:fofType), ((((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2)))->(((eq fofType) Xx) Xy))) % Found (fun (Xx:fofType) (Xy:fofType) (x:(((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2))))=> ((((eq_sym fofType) Xy) Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx)))) as proof of (forall (Xx:fofType) (Xy:fofType), ((((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2)))->(((eq fofType) Xx) Xy))) % Got proof (fun (Xx:fofType) (Xy:fofType) (x:(((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2))))=> ((((eq_sym fofType) Xy) Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx)))) % Time elapsed = 0.605418s % node=110 cost=41.000000 depth=13 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (Xx:fofType) (Xy:fofType) (x:(((eq (fofType->Prop)) (fun (Xy0:fofType)=> (((eq fofType) Xx) Xy0))) (fun (Xy_2:fofType)=> (((eq fofType) Xy) Xy_2))))=> ((((eq_sym fofType) Xy) Xx) ((x (fun (x1:(fofType->Prop))=> (x1 Xx))) ((eq_ref fofType) Xx)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------