MAYBE

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

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