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