MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(b(x1)) -> c(d(x1))
   d(d(x1)) -> b(e(x1))
   b(x1) -> d(c(x1))
   d(x1) -> x1
   e(c(x1)) -> d(a(x1))
   a(x1) -> e(d(x1))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [e](x0) = x0,
    
    [c](x0) = x0 + 12,
    
    [d](x0) = x0 + 18,
    
    [a](x0) = x0 + 23,
    
    [b](x0) = x0 + 10
   orientation:
    a(b(x1)) = x1 + 33 >= x1 + 30 = c(d(x1))
    
    d(d(x1)) = x1 + 36 >= x1 + 10 = b(e(x1))
    
    b(x1) = x1 + 10 >= x1 + 30 = d(c(x1))
    
    d(x1) = x1 + 18 >= x1 = x1
    
    e(c(x1)) = x1 + 12 >= x1 + 41 = d(a(x1))
    
    a(x1) = x1 + 23 >= x1 + 18 = e(d(x1))
   problem:
    strict:
     b(x1) -> d(c(x1))
     e(c(x1)) -> d(a(x1))
    weak:
     a(b(x1)) -> c(d(x1))
     d(d(x1)) -> b(e(x1))
     d(x1) -> x1
     a(x1) -> e(d(x1))
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [e](x0) = x0 + 4,
     
     [c](x0) = x0 + 1,
     
     [d](x0) = x0 + 17,
     
     [a](x0) = x0 + 21,
     
     [b](x0) = x0 + 30
    orientation:
     b(x1) = x1 + 30 >= x1 + 18 = d(c(x1))
     
     e(c(x1)) = x1 + 5 >= x1 + 38 = d(a(x1))
     
     a(b(x1)) = x1 + 51 >= x1 + 18 = c(d(x1))
     
     d(d(x1)) = x1 + 34 >= x1 + 34 = b(e(x1))
     
     d(x1) = x1 + 17 >= x1 = x1
     
     a(x1) = x1 + 21 >= x1 + 21 = e(d(x1))
    problem:
     strict:
      e(c(x1)) -> d(a(x1))
     weak:
      b(x1) -> d(c(x1))
      a(b(x1)) -> c(d(x1))
      d(d(x1)) -> b(e(x1))
      d(x1) -> x1
      a(x1) -> e(d(x1))
    Open