%------------------------------------------------------------------------------
% File     : NUN054+2 : TPTP v8.2.0. Released v7.3.0.
% Domain   : Number Theory
% Problem  : Robinson arithmetic: 0+1=1
% Version  : Especial.
% English  :

% Refs     : [BBJ03] Boolos et al. (2003), Computability and Logic
%          : [Smi07] Smith (2007), An Introduction to Goedel's Theorems
%          : [Lam18] Lampert (2018), Email to Geoff Sutcliffe
% Source   : [Lam18]
% Names    : zeroplusoneeqone [Lam18]

% Status   : Theorem
% Rating   : 0.31 v8.2.0, 0.28 v7.5.0, 0.31 v7.4.0, 0.23 v7.3.0
% Syntax   : Number of formulae    :   12 (   0 unt;   0 def)
%            Number of atoms       :   51 (  18 equ)
%            Maximal formula atoms :    7 (   4 avg)
%            Number of connectives :   53 (  14   ~;  10   |;  29   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   0 prp; 1-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   49 (  23   !;  26   ?)
% SPC      : FOF_THM_RFO_SEQ

% Comments : Translated to FOL with equality.
%------------------------------------------------------------------------------
include('Axioms/NUM008+0.ax').
%------------------------------------------------------------------------------
fof(zeroplusoneeqone,conjecture,
    ? [Y1] :
      ( ? [Y2] :
          ( ? [Y4] :
              ( r1(Y4)
              & r3(Y4,Y2,Y1) )
          & ? [Y5] :
              ( r1(Y5)
              & r2(Y5,Y2) ) )
      & ? [Y3] :
          ( Y1 = Y3
          & ? [Y6] :
              ( r1(Y6)
              & r2(Y6,Y3) ) ) ) ).

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