ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
 pairs:
 
 f#(x, y) -> g#(x, y)
 g#(h(x), y) -> f#(x, y)
 g#(h(x), y) -> g#(x, y)
 rules:
 
 f(x, y) -> g(x, y)
 g(h(x), y) -> h(f(x, y))
 g(h(x), y) -> h(g(x, y))
 
  the pairs 
 f#(x, y) -> g#(x, y)
 g#(h(x), y) -> f#(x, y)
 g#(h(x), y) -> g#(x, y)
 
 could not apply the generic root reduction pair processor with the following
 SCNP-version with mu = MS and the level mapping defined by 
 pi(f#) = [(1,4),(2,0)]
 pi(g#) = [(epsilon,0),(1,0)]
 polynomial interpretration over naturals with negative constants
 Pol(f#(x_1, x_2)) = 0
 Pol(g#(x_1, x_2)) = x_2
 Pol(h(x_1)) = 1 + x_1
 problem when orienting DPs
 cannot orient pair f#(x, y) -> g#(x, y) strictly:
 [(x,4),(y,0)] >mu [(g#(x, y),0),(x,0)] could not be ensured