TPTP Problem File: LCL692^1.p

View Solutions - Solve Problem

```%------------------------------------------------------------------------------
% File     : LCL692^1 : TPTP v7.2.0. Released v3.7.0.
% Domain   : Logical Calculi
% Problem  : Prove transitivity in the CS4 translation
% Version  : [AM+01] axioms.
% English  :

% Refs     : [AM+01] Alechina et al. (2001), Categorical and Kripke Semanti
%          : [Gar09] Garg (2009), Email to Geoff Sutcliffe
% Source   : [Gar09]
% Names    :

% Status   : Theorem
% Rating   : 0.78 v7.2.0, 0.75 v7.0.0, 0.71 v6.4.0, 0.67 v6.3.0, 0.80 v6.2.0, 0.86 v5.5.0, 0.83 v5.4.0, 0.80 v5.3.0, 1.00 v3.7.0
% Syntax   : Number of formulae    :   61 (   0 unit;  31 type;  24 defn)
%            Number of atoms       :  175 (  24 equality;  62 variable)
%            Maximal formula depth :    9 (   5 average)
%            Number of connectives :  100 (   3   ~;   1   |;   2   &;  93   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of type conns  :  129 ( 129   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   36 (  31   :;   0   =)
%            Number of variables   :   52 (   2 sgn;  10   !;   4   ?;  38   ^)
%                                         (  52   :;   0  !>;   0  ?*)
%                                         (   0  @-;   0  @+)
% SPC      : TH0_THM_EQU_NAR