%------------------------------------------------------------------------------
% File     : SYO208^5 : TPTP v7.1.0. Released v4.0.0.
% Domain   : Syntactic
% Problem  : TPS problem CT31
% Version  : Especial.
% English  :

% Refs     : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% Source   : [Bro09]
% Names    : tps_0179 [Bro09]
%          : CT31 [TPS]

% Status   : Theorem
% Rating   : 0.38 v7.0.0, 0.57 v6.4.0, 0.50 v6.3.0, 0.60 v6.2.0, 0.71 v6.1.0, 0.57 v6.0.0, 0.71 v5.5.0, 0.67 v5.4.0, 0.40 v4.1.0, 0.33 v4.0.1, 0.67 v4.0.0
% Syntax   : Number of formulae    :    2 (   0 unit;   1 type;   0 defn)
%            Number of atoms       :    8 (   3 equality;   5 variable)
%            Maximal formula depth :    8 (   5 average)
%            Number of connectives :    2 (   1   ~;   0   |;   0   &;   1   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%                                         (   0  ~|;   0  ~&)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   1   :;   0   =)
%            Number of variables   :    3 (   0 sgn;   1   !;   2   ?;   0   ^)
%                                         (   3   :;   0  !>;   0  ?*)
%                                         (   0  @-;   0  @+)
% SPC      : TH0_THM_EQU_NAR

% Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
%            project in the Department of Mathematical Sciences at Carnegie
%            Mellon University. Distributed under the Creative Commons copyleft
%            license: http://creativecommons.org/licenses/by-sa/3.0/
%          : 
%------------------------------------------------------------------------------
thf(a_type,type,(
    a: $tType )).

thf(cCT31,conjecture,(
    ~ ( ? [Xg: a > a > $o] :
        ! [Xf: a > $o] :
        ? [Xj: a] :
          ( ( ( Xg @ Xj )
            = Xf )
          = ( Xf = Xf ) ) ) )).

%------------------------------------------------------------------------------