MAYBE

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

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