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