MAYBE

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

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