MAYBE

Problem:
 g(c(),g(c(),x)) -> g(e(),g(d(),x))
 g(d(),g(d(),x)) -> g(c(),g(e(),x))
 g(e(),g(e(),x)) -> g(d(),g(c(),x))
 f(g(x,y)) -> g(y,g(f(f(x)),a()))
 g(x,g(y,g(x,y))) -> g(a(),g(x,g(y,b())))

Proof:
 RT Transformation Processor:
  strict:
   g(c(),g(c(),x)) -> g(e(),g(d(),x))
   g(d(),g(d(),x)) -> g(c(),g(e(),x))
   g(e(),g(e(),x)) -> g(d(),g(c(),x))
   f(g(x,y)) -> g(y,g(f(f(x)),a()))
   g(x,g(y,g(x,y))) -> g(a(),g(x,g(y,b())))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [b] = 16,
    
    [a] = 4,
    
    [f](x0) = x0 + 3,
    
    [d] = 15,
    
    [e] = 16,
    
    [g](x0, x1) = x0 + x1 + 10,
    
    [c] = 10
   orientation:
    g(c(),g(c(),x)) = x + 40 >= x + 51 = g(e(),g(d(),x))
    
    g(d(),g(d(),x)) = x + 50 >= x + 46 = g(c(),g(e(),x))
    
    g(e(),g(e(),x)) = x + 52 >= x + 45 = g(d(),g(c(),x))
    
    f(g(x,y)) = x + y + 13 >= x + y + 30 = g(y,g(f(f(x)),a()))
    
    g(x,g(y,g(x,y))) = 2x + 2y + 30 >= x + y + 50 = g(a(),g(x,g(y,b())))
   problem:
    strict:
     g(c(),g(c(),x)) -> g(e(),g(d(),x))
     f(g(x,y)) -> g(y,g(f(f(x)),a()))
     g(x,g(y,g(x,y))) -> g(a(),g(x,g(y,b())))
    weak:
     g(d(),g(d(),x)) -> g(c(),g(e(),x))
     g(e(),g(e(),x)) -> g(d(),g(c(),x))
   Open