We consider the following Problem:

  Strict Trs:
    {  f(a(), f(b(), x)) -> f(a(), f(a(), f(a(), x)))
     , f(b(), f(a(), x)) -> f(b(), f(b(), f(b(), x)))}
  StartTerms: basic terms
  Strategy: innermost

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

Proof:
  We consider the following Problem:
  
    Strict Trs:
      {  f(a(), f(b(), x)) -> f(a(), f(a(), f(a(), x)))
       , f(b(), f(a(), x)) -> f(b(), f(b(), f(b(), 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(a(), f(b(), x)) -> f(a(), f(a(), f(a(), x)))}
    
    Interpretation of nonconstant growth:
    -------------------------------------
      The following argument positions are usable:
        Uargs(f) = {2}
      We have the following EDA-non-satisfying and IDA(1)-non-satisfying matrix interpretation:
      Interpretation Functions:
       f(x1, x2) = [1 0] x1 + [1 0] x2 + [0]
                   [0 1]      [0 1]      [0]
       a() = [0]
             [0]
       b() = [1]
             [0]
    
    The strictly oriented rules are moved into the weak component.
    
    We consider the following Problem:
    
      Strict Trs: {f(b(), f(a(), x)) -> f(b(), f(b(), f(b(), x)))}
      Weak Trs: {f(a(), f(b(), x)) -> f(a(), f(a(), f(a(), x)))}
      StartTerms: basic terms
      Strategy: innermost
    
    Certificate: YES(?,O(n^1))
    
    Proof:
      We consider the following Problem:
      
        Strict Trs: {f(b(), f(a(), x)) -> f(b(), f(b(), f(b(), x)))}
        Weak Trs: {f(a(), f(b(), x)) -> f(a(), f(a(), f(a(), x)))}
        StartTerms: basic terms
        Strategy: innermost
      
      Certificate: YES(?,O(n^1))
      
      Proof:
        The problem is match-bounded by 0.
        The enriched problem is compatible with the following automaton:
        {  f_0(2, 2) -> 1
         , a_0() -> 2
         , b_0() -> 2}

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