We consider the following Problem:

  Strict Trs:
    {  f(s(x)) -> f(g(x, x))
     , g(0(), 1()) -> s(0())
     , 0() -> 1()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: YES(?,O(n^1))

Proof:
  Arguments of following rules are not normal-forms:
  {g(0(), 1()) -> s(0())}
  
  All above mentioned rules can be savely removed.
  
  We consider the following Problem:
  
    Strict Trs:
      {  f(s(x)) -> f(g(x, x))
       , 0() -> 1()}
    StartTerms: basic terms
    Strategy: innermost
  
  Certificate: YES(?,O(n^1))
  
  Proof:
    The weightgap principle applies, where following rules are oriented strictly:
    
    TRS Component: {0() -> 1()}
    
    Interpretation of nonconstant growth:
    -------------------------------------
      The following argument positions are usable:
        Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}
      We have the following EDA-non-satisfying and IDA(1)-non-satisfying matrix interpretation:
      Interpretation Functions:
       f(x1) = [0 0] x1 + [1]
               [0 0]      [1]
       s(x1) = [0 0] x1 + [0]
               [0 0]      [0]
       g(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                   [0 0]      [0 0]      [0]
       0() = [2]
             [0]
       1() = [0]
             [0]
    
    The strictly oriented rules are moved into the weak component.
    
    We consider the following Problem:
    
      Strict Trs: {f(s(x)) -> f(g(x, x))}
      Weak Trs: {0() -> 1()}
      StartTerms: basic terms
      Strategy: innermost
    
    Certificate: YES(?,O(n^1))
    
    Proof:
      The weightgap principle applies, where following rules are oriented strictly:
      
      TRS Component: {f(s(x)) -> f(g(x, x))}
      
      Interpretation of nonconstant growth:
      -------------------------------------
        The following argument positions are usable:
          Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}
        We have the following EDA-non-satisfying and IDA(1)-non-satisfying matrix interpretation:
        Interpretation Functions:
         f(x1) = [0 1] x1 + [1]
                 [0 0]      [1]
         s(x1) = [0 0] x1 + [0]
                 [0 0]      [2]
         g(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                     [0 0]      [0 0]      [0]
         0() = [0]
               [0]
         1() = [0]
               [0]
      
      The strictly oriented rules are moved into the weak component.
      
      We consider the following Problem:
      
        Weak Trs:
          {  f(s(x)) -> f(g(x, x))
           , 0() -> 1()}
        StartTerms: basic terms
        Strategy: innermost
      
      Certificate: YES(O(1),O(1))
      
      Proof:
        We consider the following Problem:
        
          Weak Trs:
            {  f(s(x)) -> f(g(x, x))
             , 0() -> 1()}
          StartTerms: basic terms
          Strategy: innermost
        
        Certificate: YES(O(1),O(1))
        
        Proof:
          Empty rules are trivially bounded

Hurray, we answered YES(?,O(n^1))