ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  *#(s(x), y) -> *#(x, y)
  *#(p(x), y) -> *#(x, y)
  rules:
  
  *(0, y) -> 0
  *(s(x), y) -> +(*(x, y), y)
  *(p(x), y) -> +(*(x, y), minus(y))
  +(0, y) -> y
  +(s(x), y) -> s(+(x, y))
  +(p(x), y) -> p(+(x, y))
  minus(0) -> 0
  minus(s(x)) -> p(minus(x))
  minus(p(x)) -> s(minus(x))
  p(s(x)) -> x
  s(p(x)) -> x
  
   the pairs 
  *#(s(x), y) -> *#(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(*#) = [(epsilon,0),(1,1)]
  Argument Filter: 
  pi(*#/2) = 2
  pi(p/1) = 1
  pi(s/1) = [1]
  
  RPO with the following precedence
  precedence(s[1]) = 0
  
  precedence(_) = 0
  and the following status
  status(s[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair *#(p(x), y) -> *#(x, y) weakly:
  [(*#(p(x), y),0),(p(x),1)] >=mu [(*#(x, y),0),(x,1)] could not be ensured