MAYBE

Problem:
 a(a(x1)) -> b(c(x1))
 b(b(x1)) -> c(d(x1))
 c(c(x1)) -> d(d(d(x1)))
 d(c(x1)) -> b(f(x1))
 d(d(d(x1))) -> a(c(x1))
 f(f(x1)) -> f(b(x1))

Proof:
 Complexity Transformation Processor:
  strict:
   a(a(x1)) -> b(c(x1))
   b(b(x1)) -> c(d(x1))
   c(c(x1)) -> d(d(d(x1)))
   d(c(x1)) -> b(f(x1))
   d(d(d(x1))) -> a(c(x1))
   f(f(x1)) -> f(b(x1))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [f](x0) = x0,
     
     [d](x0) = x0 + 1,
     
     [b](x0) = x0,
     
     [c](x0) = x0,
     
     [a](x0) = x0
    orientation:
     a(a(x1)) = x1 >= x1 = b(c(x1))
     
     b(b(x1)) = x1 >= x1 + 1 = c(d(x1))
     
     c(c(x1)) = x1 >= x1 + 3 = d(d(d(x1)))
     
     d(c(x1)) = x1 + 1 >= x1 = b(f(x1))
     
     d(d(d(x1))) = x1 + 3 >= x1 = a(c(x1))
     
     f(f(x1)) = x1 >= x1 = f(b(x1))
    problem:
     strict:
      a(a(x1)) -> b(c(x1))
      b(b(x1)) -> c(d(x1))
      c(c(x1)) -> d(d(d(x1)))
      f(f(x1)) -> f(b(x1))
     weak:
      d(c(x1)) -> b(f(x1))
      d(d(d(x1))) -> a(c(x1))
    Matrix Interpretation Processor:
     dimension: 1
     max_matrix:
      1
      interpretation:
       [f](x0) = x0,
       
       [d](x0) = x0 + 1,
       
       [b](x0) = x0,
       
       [c](x0) = x0,
       
       [a](x0) = x0 + 1
      orientation:
       a(a(x1)) = x1 + 2 >= x1 = b(c(x1))
       
       b(b(x1)) = x1 >= x1 + 1 = c(d(x1))
       
       c(c(x1)) = x1 >= x1 + 3 = d(d(d(x1)))
       
       f(f(x1)) = x1 >= x1 = f(b(x1))
       
       d(c(x1)) = x1 + 1 >= x1 = b(f(x1))
       
       d(d(d(x1))) = x1 + 3 >= x1 + 1 = a(c(x1))
      problem:
       strict:
        b(b(x1)) -> c(d(x1))
        c(c(x1)) -> d(d(d(x1)))
        f(f(x1)) -> f(b(x1))
       weak:
        a(a(x1)) -> b(c(x1))
        d(c(x1)) -> b(f(x1))
        d(d(d(x1))) -> a(c(x1))
      Matrix Interpretation Processor:
       dimension: 1
       max_matrix:
        1
        interpretation:
         [f](x0) = x0 + 1,
         
         [d](x0) = x0 + 1,
         
         [b](x0) = x0,
         
         [c](x0) = x0,
         
         [a](x0) = x0 + 1
        orientation:
         b(b(x1)) = x1 >= x1 + 1 = c(d(x1))
         
         c(c(x1)) = x1 >= x1 + 3 = d(d(d(x1)))
         
         f(f(x1)) = x1 + 2 >= x1 + 1 = f(b(x1))
         
         a(a(x1)) = x1 + 2 >= x1 = b(c(x1))
         
         d(c(x1)) = x1 + 1 >= x1 + 1 = b(f(x1))
         
         d(d(d(x1))) = x1 + 3 >= x1 + 1 = a(c(x1))
        problem:
         strict:
          b(b(x1)) -> c(d(x1))
          c(c(x1)) -> d(d(d(x1)))
         weak:
          f(f(x1)) -> f(b(x1))
          a(a(x1)) -> b(c(x1))
          d(c(x1)) -> b(f(x1))
          d(d(d(x1))) -> a(c(x1))
        Open