We consider the following Problem:

  Strict Trs:
    {  f(s(X)) -> f(X)
     , g(cons(0(), Y)) -> g(Y)
     , g(cons(s(X), Y)) -> s(X)
     , h(cons(X, Y)) -> h(g(cons(X, Y)))}
  StartTerms: basic terms
  Strategy: innermost

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

Proof:
  We consider the following Problem:
  
    Strict Trs:
      {  f(s(X)) -> f(X)
       , g(cons(0(), Y)) -> g(Y)
       , g(cons(s(X), Y)) -> s(X)
       , h(cons(X, Y)) -> h(g(cons(X, Y)))}
    StartTerms: basic terms
    Strategy: innermost
  
  Certificate: YES(?,O(n^1))
  
  Proof:
    The weightgap principle applies, where following rules are oriented strictly:
    
    TRS Component: {g(cons(s(X), Y)) -> s(X)}
    
    Interpretation of nonconstant growth:
    -------------------------------------
      The following argument positions are usable:
        Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(cons) = {},
        Uargs(h) = {1}
      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) = [0 0] x1 + [1]
               [0 0]      [1]
       cons(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                      [0 0]      [0 0]      [0]
       0() = [0]
             [0]
       h(x1) = [1 0] x1 + [1]
               [0 0]      [1]
    
    The strictly oriented rules are moved into the weak component.
    
    We consider the following Problem:
    
      Strict Trs:
        {  f(s(X)) -> f(X)
         , g(cons(0(), Y)) -> g(Y)
         , h(cons(X, Y)) -> h(g(cons(X, Y)))}
      Weak Trs: {g(cons(s(X), Y)) -> s(X)}
      StartTerms: basic terms
      Strategy: innermost
    
    Certificate: YES(?,O(n^1))
    
    Proof:
      The weightgap principle applies, where following rules are oriented strictly:
      
      TRS Component: {h(cons(X, Y)) -> h(g(cons(X, Y)))}
      
      Interpretation of nonconstant growth:
      -------------------------------------
        The following argument positions are usable:
          Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(cons) = {},
          Uargs(h) = {1}
        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) = [0 0] x1 + [1]
                 [0 0]      [1]
         cons(x1, x2) = [0 0] x1 + [0 0] x2 + [0]
                        [0 0]      [0 0]      [2]
         0() = [0]
               [0]
         h(x1) = [1 3] x1 + [2]
                 [0 0]      [1]
      
      The strictly oriented rules are moved into the weak component.
      
      We consider the following Problem:
      
        Strict Trs:
          {  f(s(X)) -> f(X)
           , g(cons(0(), Y)) -> g(Y)}
        Weak Trs:
          {  h(cons(X, Y)) -> h(g(cons(X, Y)))
           , g(cons(s(X), Y)) -> s(X)}
        StartTerms: basic terms
        Strategy: innermost
      
      Certificate: YES(?,O(n^1))
      
      Proof:
        The weightgap principle applies, where following rules are oriented strictly:
        
        TRS Component: {g(cons(0(), Y)) -> g(Y)}
        
        Interpretation of nonconstant growth:
        -------------------------------------
          The following argument positions are usable:
            Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(cons) = {},
            Uargs(h) = {1}
          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) = [0 1] x1 + [1]
                   [0 0]      [1]
           cons(x1, x2) = [0 0] x1 + [0 0] x2 + [2]
                          [1 1]      [0 1]      [3]
           0() = [2]
                 [3]
           h(x1) = [1 1] x1 + [0]
                   [0 0]      [1]
        
        The strictly oriented rules are moved into the weak component.
        
        We consider the following Problem:
        
          Strict Trs: {f(s(X)) -> f(X)}
          Weak Trs:
            {  g(cons(0(), Y)) -> g(Y)
             , h(cons(X, Y)) -> h(g(cons(X, Y)))
             , g(cons(s(X), Y)) -> s(X)}
          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(X)}
          
          Interpretation of nonconstant growth:
          -------------------------------------
            The following argument positions are usable:
              Uargs(f) = {}, Uargs(s) = {}, Uargs(g) = {}, Uargs(cons) = {},
              Uargs(h) = {1}
            We have the following EDA-non-satisfying and IDA(1)-non-satisfying matrix interpretation:
            Interpretation Functions:
             f(x1) = [0 1] x1 + [2]
                     [0 0]      [1]
             s(x1) = [0 0] x1 + [0]
                     [0 1]      [3]
             g(x1) = [0 0] x1 + [1]
                     [0 1]      [1]
             cons(x1, x2) = [0 0] x1 + [0 0] x2 + [2]
                            [0 1]      [0 1]      [0]
             0() = [0]
                   [0]
             h(x1) = [1 0] x1 + [0]
                     [0 0]      [1]
          
          The strictly oriented rules are moved into the weak component.
          
          We consider the following Problem:
          
            Weak Trs:
              {  f(s(X)) -> f(X)
               , g(cons(0(), Y)) -> g(Y)
               , h(cons(X, Y)) -> h(g(cons(X, Y)))
               , g(cons(s(X), Y)) -> s(X)}
            StartTerms: basic terms
            Strategy: innermost
          
          Certificate: YES(O(1),O(1))
          
          Proof:
            We consider the following Problem:
            
              Weak Trs:
                {  f(s(X)) -> f(X)
                 , g(cons(0(), Y)) -> g(Y)
                 , h(cons(X, Y)) -> h(g(cons(X, Y)))
                 , g(cons(s(X), Y)) -> s(X)}
              StartTerms: basic terms
              Strategy: innermost
            
            Certificate: YES(O(1),O(1))
            
            Proof:
              Empty rules are trivially bounded

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