%------------------------------------------------------------------------------
% File     : CSR152_8 : TPTP v9.0.0. Released v8.0.0.
% Domain   : Commonsense Reasoning
% Problem  : Does Chris know that Sue likes Bill?
% Version  : Especial * Reduced > Especial.
% English  : Everybody knows that Chris is equal to Chris. Mary likes Bill. 
%            Chris knows that Sue likes whoever Mary likes. Does Chris know 
%            that Sue likes Bill?

% Refs     : 
% Source   : [TPTP]
% Names    : 

% Status   : Theorem
% Rating   : 0.00 v8.1.0
% Syntax   : Number of formulae    :   11 (   4 unt;   7 typ;   0 def)
%            Number of atoms       :    8 (   1 equ)
%            Maximal formula atoms :    1 (   0 avg)
%            Number of connectives :    1 (   0   ~;   0   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    1 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    3 (   3 fml;   0 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   0 prp; 2-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    1 (   1   !;   0   ?;   1   :)
% SPC      : TX0_THM_EQU_NAR

% Comments : Translated to TXF from the THF version.
%------------------------------------------------------------------------------
%----The extracted Signature
tff(numbers,type,
    num: $tType ).

tff(knows_THFTYPE_IiooI,type,
    knows_THFTYPE_IiooI: ( $i * $o ) > $o ).

tff(lBill_THFTYPE_i,type,
    lBill_THFTYPE_i: $i ).

tff(lChris_THFTYPE_i,type,
    lChris_THFTYPE_i: $i ).

tff(lMary_THFTYPE_i,type,
    lMary_THFTYPE_i: $i ).

tff(lSue_THFTYPE_i,type,
    lSue_THFTYPE_i: $i ).

tff(likes_THFTYPE_IiioI,type,
    likes_THFTYPE_IiioI: ( $i * $i ) > $o ).

%----The translated axioms
tff(ax,axiom,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,lChris_THFTYPE_i = lChris_THFTYPE_i) ).

tff(ax_001,axiom,
    likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i) ).

tff(ax_002,axiom,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,
      ! [X: $i] :
        ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,X)
       => likes_THFTYPE_IiioI(lSue_THFTYPE_i,X) )) ).

%----The translated conjectures
tff(con,conjecture,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)) ).

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