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:
  
  sel#(s(X), cons(Y, Z)) -> sel#(X, activate(Z))
  rules:
  
  activate(n__from(X)) -> from(X)
  activate(X) -> X
  from(X) -> cons(X, n__from(s(X)))
  from(X) -> n__from(X)
  sel(0, cons(X, Y)) -> X
  sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
  
   the pairs 
  sel#(s(X), cons(Y, Z)) -> sel#(X, activate(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(sel#) = [(1,2),(2,2)]
  Argument Filter: 
  pi(sel#/2) = []
  pi(s/1) = [1]
  pi(cons/2) = 2
  pi(activate/1) = 1
  pi(n__from/1) = []
  pi(from/1) = []
  
  RPO with the following precedence
  precedence(sel#[2]) = 1
  precedence(s[1]) = 0
  precedence(n__from[1]) = 2
  precedence(from[1]) = 2
  
  precedence(_) = 0
  and the following status
  status(sel#[2]) = lex
  status(s[1]) = lex
  status(n__from[1]) = lex
  status(from[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair sel#(s(X), cons(Y, Z)) -> sel#(X, activate(Z)) strictly:
  [(s(X),2),(cons(Y, Z),2)] >mu [(X,2),(activate(Z),2)] could not be ensured