%------------------------------------------------------------------------------
% File     : SYO718+1 : TPTP v8.2.0. Released v7.4.0.
% Domain   : Syntactic
% Problem  : SuperPostulates problem sp190R2
% Version  : Especial.
% English  :

% Refs     : [Lam20] Lampert (2020), Email to Geoff Sutcliffe
%          : [LN20]  Lampert & Nakano (2020), Deciding Simple Infinity Axio
% Source   : [Lam20]
% Names    : sp190R2.p [Lam20]

% Status   : Satisfiable
% Rating   : 1.00 v7.4.0
% Syntax   : Number of formulae    :    7 (   0 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :   14 (   5 avg)
%            Number of connectives :   47 (  18   ~;   9   |;  20   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   9 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    1 (   1 usr;   0 prp; 2-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   35 (  14   !;  21   ?)
% SPC      : FOF_SAT_RFO_NEQ

% Comments : Has only infinite models.
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
    ? [Y1] :
      ( ? [Y2] :
          ( ? [Y3] :
              ( ? [Y4] :
                  ( ? [Y5] :
                      ( ? [Y6] : ~ f(Y6,Y5)
                      & f(Y4,Y5) )
                  & ~ f(Y4,Y3) )
              & ~ f(Y3,Y2) )
          & f(Y1,Y2) )
      & ! [X1] :
          ( f(X1,X1)
          | ~ f(Y1,X1) ) ) ).

fof(axiom_2,axiom,
    ? [Y1] :
      ( ? [Y2] :
          ( ? [Y4] :
              ( ? [Y6] :
                  ( ? [Y8] :
                      ( ? [Y9] :
                          ( ? [Y10] :
                              ( ? [Y11] : ~ f(Y11,Y10)
                              & f(Y9,Y10) )
                          & ~ f(Y9,Y8) )
                      & ~ f(Y8,Y6) )
                  & f(Y4,Y6) )
              & f(Y2,Y4)
              & ~ f(Y4,Y4) )
          & f(Y1,Y2)
          & f(Y2,Y2) )
      & ? [Y3] :
          ( ? [Y5] :
              ( ? [Y7] :
                  ( ~ f(Y5,Y7)
                  & f(Y7,Y7) )
              & ~ f(Y3,Y5) )
          & f(Y3,Y1) )
      & ~ f(Y1,Y1) ) ).

fof(axiom_3,axiom,
    ? [Y1] :
    ! [X1] :
      ( ~ f(Y1,X1)
      | ! [X2] : f(X2,X1) ) ).

fof(axiom_4,axiom,
    ! [X1] :
    ? [Y1] :
      ( f(Y1,X1)
      & ? [Y2] : ~ f(Y1,Y2) ) ).

fof(axiom_5,axiom,
    ! [X1,X2,X3] :
      ( ~ f(X2,X1)
      | ~ f(X3,X2)
      | f(X3,X1) ) ).

fof(axiom_6,axiom,
    ! [X1,X2] :
      ( f(X2,X1)
      | ! [X3] :
          ( f(X3,X2)
          | ~ f(X3,X1) ) ) ).

fof(axiom_7,axiom,
    ! [X1] :
      ( ! [X2] :
          ( ! [X3] :
              ( ! [X4] : f(X3,X4)
              | f(X2,X3) )
          | ~ f(X2,X1) )
      | ? [Y1] :
          ( ~ f(Y1,Y1)
          & f(Y1,X1) ) ) ).

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