MAYBE

Problem:
 f(h(x)) -> f(i(x))
 f(i(x)) -> a()
 i(x) -> h(x)

Proof:
 RT Transformation Processor:
  strict:
   f(h(x)) -> f(i(x))
   f(i(x)) -> a()
   i(x) -> h(x)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [a] = 0,
    
    [i](x0) = x0 + 1,
    
    [f](x0) = x0 + 23,
    
    [h](x0) = x0
   orientation:
    f(h(x)) = x + 23 >= x + 24 = f(i(x))
    
    f(i(x)) = x + 24 >= 0 = a()
    
    i(x) = x + 1 >= x = h(x)
   problem:
    strict:
     f(h(x)) -> f(i(x))
    weak:
     f(i(x)) -> a()
     i(x) -> h(x)
   Open