%--------------------------------------------------------------------------
% File     : SYN365+1 : TPTP v8.2.0. Released v2.0.0.
% Domain   : Syntactic
% Problem  : Peter Andrews Problem X2116
% Version  : Especial.
% English  :

% Refs     : [And86] Andrews (1986), An Introduction to Mathematical Logic
%          : [And94] Andrews (1994), Email to G. Sutcliffe
% Source   : [And94]
% Names    : X2116 [And86]

% Status   : Theorem
% Rating   : 0.00 v5.5.0, 0.04 v5.3.0, 0.13 v5.2.0, 0.07 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.00 v2.1.0
% Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
%            Number of atoms       :    9 (   0 equ)
%            Maximal formula atoms :    9 (   9 avg)
%            Number of connectives :    8 (   0   ~;   0   |;   4   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   7 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   2 usr;   0 prp; 1-2 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :    5 (   3   !;   2   ?)
% SPC      : FOF_THM_RFO_NEQ

% Comments :
%--------------------------------------------------------------------------
fof(x2116,conjecture,
    ( ( ! [X] :
        ? [Y] :
          ( big_p(X)
         => ( big_r(X,g(h(Y)))
            & big_p(Y) ) )
      & ! [W] :
          ( big_p(W)
         => ( big_p(g(W))
            & big_p(h(W)) ) ) )
   => ! [X] :
        ( big_p(X)
       => ? [Y] :
            ( big_r(X,Y)
            & big_p(Y) ) ) ) ).

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