MAYBE

Problem:
 1(0(x1)) -> 0(0(0(1(x1))))
 0(1(x1)) -> 1(x1)
 1(1(x1)) -> 0(0(0(0(x1))))
 0(0(x1)) -> 0(x1)

Proof:
 RT Transformation Processor:
  strict:
   1(0(x1)) -> 0(0(0(1(x1))))
   0(1(x1)) -> 1(x1)
   1(1(x1)) -> 0(0(0(0(x1))))
   0(0(x1)) -> 0(x1)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [1](x0) = x0 + 20,
    
    [0](x0) = x0
   orientation:
    1(0(x1)) = x1 + 20 >= x1 + 20 = 0(0(0(1(x1))))
    
    0(1(x1)) = x1 + 20 >= x1 + 20 = 1(x1)
    
    1(1(x1)) = x1 + 40 >= x1 = 0(0(0(0(x1))))
    
    0(0(x1)) = x1 >= x1 = 0(x1)
   problem:
    strict:
     1(0(x1)) -> 0(0(0(1(x1))))
     0(1(x1)) -> 1(x1)
     0(0(x1)) -> 0(x1)
    weak:
     1(1(x1)) -> 0(0(0(0(x1))))
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [1](x0) = x0 + 17,
     
     [0](x0) = x0 + 2
    orientation:
     1(0(x1)) = x1 + 19 >= x1 + 23 = 0(0(0(1(x1))))
     
     0(1(x1)) = x1 + 19 >= x1 + 17 = 1(x1)
     
     0(0(x1)) = x1 + 4 >= x1 + 2 = 0(x1)
     
     1(1(x1)) = x1 + 34 >= x1 + 8 = 0(0(0(0(x1))))
    problem:
     strict:
      1(0(x1)) -> 0(0(0(1(x1))))
     weak:
      0(1(x1)) -> 1(x1)
      0(0(x1)) -> 0(x1)
      1(1(x1)) -> 0(0(0(0(x1))))
    Open