MAYBE

Problem:
 f(x) -> g(f(x))
 g(f(x)) -> x
 g(x) -> a()

Proof:
 RT Transformation Processor:
  strict:
   f(x) -> g(f(x))
   g(f(x)) -> x
   g(x) -> a()
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [a] = 0,
    
    [g](x0) = x0 + 21,
    
    [f](x0) = x0 + 14
   orientation:
    f(x) = x + 14 >= x + 35 = g(f(x))
    
    g(f(x)) = x + 35 >= x = x
    
    g(x) = x + 21 >= 0 = a()
   problem:
    strict:
     f(x) -> g(f(x))
    weak:
     g(f(x)) -> x
     g(x) -> a()
   Open