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,3)]
 Argument Filter: 
 pi(*#/2) = 2
 pi(+/2) = [1,2]
 
 RPO with the following precedence
 precedence(+[2]) = 0
 
 precedence(_) = 0
 and the following status
 status(+[2]) = lex
 
 status(_) = lex
 
 problem when orienting DPs
 cannot orient pair *#(+(x, y), z) -> *#(x, z) strictly:
 [(*#(+(x, y), z),0),(+(x, y),3)] >mu [(*#(x, z),0),(x,3)] could not be ensured