MAYBE

Problem:
 g(X) -> h(X)
 c() -> d()
 h(d()) -> g(c())

Proof:
 RT Transformation Processor:
  strict:
   g(X) -> h(X)
   c() -> d()
   h(d()) -> g(c())
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [d] = 16,
    
    [c] = 22,
    
    [h](x0) = x0 + 19,
    
    [g](x0) = x0 + 12
   orientation:
    g(X) = X + 12 >= X + 19 = h(X)
    
    c() = 22 >= 16 = d()
    
    h(d()) = 35 >= 34 = g(c())
   problem:
    strict:
     g(X) -> h(X)
    weak:
     c() -> d()
     h(d()) -> g(c())
   Open