MAYBE

Problem:
 f(X,g(X)) -> f(1(),g(X))
 g(1()) -> g(0())

Proof:
 RT Transformation Processor:
  strict:
   f(X,g(X)) -> f(1(),g(X))
   g(1()) -> g(0())
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [0] = 12,
    
    [1] = 25,
    
    [f](x0, x1) = x0 + x1 + 23,
    
    [g](x0) = x0 + 6
   orientation:
    f(X,g(X)) = 2X + 29 >= X + 54 = f(1(),g(X))
    
    g(1()) = 31 >= 18 = g(0())
   problem:
    strict:
     f(X,g(X)) -> f(1(),g(X))
    weak:
     g(1()) -> g(0())
   Open