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:
  
  times#(x, plus(y, s(z))) -> times#(x, plus(y, times(s(z), 0)))
  times#(x, plus(y, s(z))) -> times#(x, s(z))
  times#(x, s(y)) -> times#(x, y)
  rules:
  
  plus(x, 0) -> x
  plus(x, s(y)) -> s(plus(x, y))
  times(x, plus(y, s(z))) -> plus(times(x, plus(y, times(s(z), 0))), times(x, s(z)))
  times(x, 0) -> 0
  times(x, s(y)) -> plus(times(x, y), x)
  
   the pairs 
  times#(x, plus(y, s(z))) -> times#(x, s(z))
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MAX and the level mapping defined by 
  pi(times#) = [(epsilon,0),(2,0)]
  Argument Filter: 
  pi(times#/2) = 2
  pi(plus/2) = [1,2]
  pi(s/1) = 1
  pi(times/2) = []
  pi(0/0) = []
  
  RPO with the following precedence
  precedence(plus[2]) = 1
  precedence(times[2]) = 0
  precedence(0[0]) = 0
  
  precedence(_) = 0
  and the following status
  status(plus[2]) = mul
  status(times[2]) = mul
  status(0[0]) = mul
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair times#(x, plus(y, s(z))) -> times#(x, plus(y, times(s(z), 0))) weakly:
  [(times#(x, plus(y, s(z))),0),(plus(y, s(z)),0)] >=mu [(times#(x, plus(y, times(s(z), 0))),0),(plus(y, times(s(z), 0)),0)] could not be ensured