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:
  
  activate#(n__cons(X1, X2)) -> activate#(X1)
  activate#(n__from(X)) -> activate#(X)
  activate#(n__s(X)) -> activate#(X)
  rules:
  
  2nd(cons(X, n__cons(Y, Z))) -> activate(Y)
  activate(n__cons(X1, X2)) -> cons(activate(X1), X2)
  activate(n__from(X)) -> from(activate(X))
  activate(n__s(X)) -> s(activate(X))
  activate(X) -> X
  cons(X1, X2) -> n__cons(X1, X2)
  from(X) -> cons(X, n__from(n__s(X)))
  from(X) -> n__from(X)
  s(X) -> n__s(X)
  
   the pairs 
  activate#(n__s(X)) -> activate#(X)
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MS and the level mapping defined by 
  pi(activate#) = [(epsilon,0),(1,0)]
  Argument Filter: 
  pi(activate#/1) = []
  pi(n__from/1) = 1
  pi(n__cons/2) = 1
  pi(n__s/1) = [1]
  
  RPO with the following precedence
  precedence(activate#[1]) = 0
  precedence(n__s[1]) = 0
  
  precedence(_) = 0
  and the following status
  status(activate#[1]) = lex
  status(n__s[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair activate#(n__cons(X1, X2)) -> activate#(X1) weakly:
  [(activate#(n__cons(X1, X2)),0),(n__cons(X1, X2),0)] >=mu [(activate#(X1),0),(X1,0)] could not be ensured