TSTP Solution File: SEV079^5 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SEV079^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 : n187.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:42 EDT 2014
% Result : Theorem 0.57s
% Output : Proof 0.57s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem : SEV079^5 : TPTP v6.1.0. Released v4.0.0.
% % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n187.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 07:56:46 CDT 2014
% % CPUTime : 0.57
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((eq fofType) X) Y)) (((eq fofType) Y) Z))->(((eq fofType) X) Z))) of role conjecture named cTRANS_ID_pme
% Conjecture to prove = (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((eq fofType) X) Y)) (((eq fofType) Y) Z))->(((eq fofType) X) Z))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['(forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((eq fofType) X) Y)) (((eq fofType) Y) Z))->(((eq fofType) X) Z)))']
% Parameter fofType:Type.
% Trying to prove (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((eq fofType) X) Y)) (((eq fofType) Y) Z))->(((eq fofType) X) Z)))
% Found eq_trans0000:=(eq_trans000 Z):((((eq fofType) X) Y)->((((eq fofType) Y) Z)->(((eq fofType) X) Z)))
% Found (eq_trans000 Z) as proof of ((((eq fofType) X) Y)->((((eq fofType) Y) Z)->(((eq fofType) X) Z)))
% Found ((eq_trans00 Y) Z) as proof of ((((eq fofType) X) Y)->((((eq fofType) Y) Z)->(((eq fofType) X) Z)))
% Found (((eq_trans0 X) Y) Z) as proof of ((((eq fofType) X) Y)->((((eq fofType) Y) Z)->(((eq fofType) X) Z)))
% Found ((((eq_trans fofType) X) Y) Z) as proof of ((((eq fofType) X) Y)->((((eq fofType) Y) Z)->(((eq fofType) X) Z)))
% Found ((((eq_trans fofType) X) Y) Z) as proof of ((((eq fofType) X) Y)->((((eq fofType) Y) Z)->(((eq fofType) X) Z)))
% Found (and_rect00 ((((eq_trans fofType) X) Y) Z)) as proof of (((eq fofType) X) Z)
% Found ((and_rect0 (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z)) as proof of (((eq fofType) X) Z)
% Found (((fun (P:Type) (x0:((((eq fofType) X) Y)->((((eq fofType) Y) Z)->P)))=> (((((and_rect (((eq fofType) X) Y)) (((eq fofType) Y) Z)) P) x0) x)) (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z)) as proof of (((eq fofType) X) Z)
% Found (fun (x:((and (((eq fofType) X) Y)) (((eq fofType) Y) Z)))=> (((fun (P:Type) (x0:((((eq fofType) X) Y)->((((eq fofType) Y) Z)->P)))=> (((((and_rect (((eq fofType) X) Y)) (((eq fofType) Y) Z)) P) x0) x)) (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z))) as proof of (((eq fofType) X) Z)
% Found (fun (Z:fofType) (x:((and (((eq fofType) X) Y)) (((eq fofType) Y) Z)))=> (((fun (P:Type) (x0:((((eq fofType) X) Y)->((((eq fofType) Y) Z)->P)))=> (((((and_rect (((eq fofType) X) Y)) (((eq fofType) Y) Z)) P) x0) x)) (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z))) as proof of (((and (((eq fofType) X) Y)) (((eq fofType) Y) Z))->(((eq fofType) X) Z))
% Found (fun (Y:fofType) (Z:fofType) (x:((and (((eq fofType) X) Y)) (((eq fofType) Y) Z)))=> (((fun (P:Type) (x0:((((eq fofType) X) Y)->((((eq fofType) Y) Z)->P)))=> (((((and_rect (((eq fofType) X) Y)) (((eq fofType) Y) Z)) P) x0) x)) (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z))) as proof of (forall (Z:fofType), (((and (((eq fofType) X) Y)) (((eq fofType) Y) Z))->(((eq fofType) X) Z)))
% Found (fun (X:fofType) (Y:fofType) (Z:fofType) (x:((and (((eq fofType) X) Y)) (((eq fofType) Y) Z)))=> (((fun (P:Type) (x0:((((eq fofType) X) Y)->((((eq fofType) Y) Z)->P)))=> (((((and_rect (((eq fofType) X) Y)) (((eq fofType) Y) Z)) P) x0) x)) (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z))) as proof of (forall (Y:fofType) (Z:fofType), (((and (((eq fofType) X) Y)) (((eq fofType) Y) Z))->(((eq fofType) X) Z)))
% Found (fun (X:fofType) (Y:fofType) (Z:fofType) (x:((and (((eq fofType) X) Y)) (((eq fofType) Y) Z)))=> (((fun (P:Type) (x0:((((eq fofType) X) Y)->((((eq fofType) Y) Z)->P)))=> (((((and_rect (((eq fofType) X) Y)) (((eq fofType) Y) Z)) P) x0) x)) (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z))) as proof of (forall (X:fofType) (Y:fofType) (Z:fofType), (((and (((eq fofType) X) Y)) (((eq fofType) Y) Z))->(((eq fofType) X) Z)))
% Got proof (fun (X:fofType) (Y:fofType) (Z:fofType) (x:((and (((eq fofType) X) Y)) (((eq fofType) Y) Z)))=> (((fun (P:Type) (x0:((((eq fofType) X) Y)->((((eq fofType) Y) Z)->P)))=> (((((and_rect (((eq fofType) X) Y)) (((eq fofType) Y) Z)) P) x0) x)) (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z)))
% Time elapsed = 0.254849s
% node=24 cost=-281.000000 depth=12
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (X:fofType) (Y:fofType) (Z:fofType) (x:((and (((eq fofType) X) Y)) (((eq fofType) Y) Z)))=> (((fun (P:Type) (x0:((((eq fofType) X) Y)->((((eq fofType) Y) Z)->P)))=> (((((and_rect (((eq fofType) X) Y)) (((eq fofType) Y) Z)) P) x0) x)) (((eq fofType) X) Z)) ((((eq_trans fofType) X) Y) Z)))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------