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:
 
 app#(app(app(compose, f), g), x) -> app#(f, app(g, x))
 app#(app(app(compose, f), g), x) -> app#(g, x)
 rules:
 
 app(app(app(compose, f), g), x) -> app(f, app(g, x))
 
  the pairs 
 app#(app(app(compose, f), g), x) -> app#(f, app(g, x))
 app#(app(app(compose, f), g), x) -> app#(g, x)
 
 could not apply the generic root reduction pair processor with the following
 SCNP-version with mu = MS and the level mapping defined by 
 pi(app#) = [(epsilon,0),(1,0)]
 polynomial interpretration over naturals with negative constants
 Pol(app#(x_1, x_2)) = 1
 Pol(app(x_1, x_2)) = x_2 + x_1
 Pol(compose) = 1
 problem when orienting DPs
 cannot orient pair app#(app(app(compose, f), g), x) -> app#(f, app(g, x)) strictly:
 [(app#(app(app(compose, f), g), x),0),(app(app(compose, f), g),0)] >mu [(app#(f, app(g, x)),0),(f,0)] could not be ensured