ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.3: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  activate#(n____(X1, X2)) -> activate#(X1)
  activate#(n____(X1, X2)) -> activate#(X2)
  rules:
  
  U11(tt) -> tt
  U21(tt, V2) -> U22(isList(activate(V2)))
  U22(tt) -> tt
  U31(tt) -> tt
  U41(tt, V2) -> U42(isNeList(activate(V2)))
  U42(tt) -> tt
  U51(tt, V2) -> U52(isList(activate(V2)))
  U52(tt) -> tt
  U61(tt) -> tt
  U71(tt, P) -> U72(isPal(activate(P)))
  U72(tt) -> tt
  U81(tt) -> tt
  __(__(X, Y), Z) -> __(X, __(Y, Z))
  __(X, nil) -> X
  __(nil, X) -> X
  __(X1, X2) -> n____(X1, X2)
  a -> n__a
  activate(n__nil) -> nil
  activate(n____(X1, X2)) -> __(activate(X1), activate(X2))
  activate(n__a) -> a
  activate(n__e) -> e
  activate(n__i) -> i
  activate(n__o) -> o
  activate(n__u) -> u
  activate(X) -> X
  e -> n__e
  i -> n__i
  isList(V) -> U11(isNeList(activate(V)))
  isList(n__nil) -> tt
  isList(n____(V1, V2)) -> U21(isList(activate(V1)), activate(V2))
  isNeList(V) -> U31(isQid(activate(V)))
  isNeList(n____(V1, V2)) -> U41(isList(activate(V1)), activate(V2))
  isNeList(n____(V1, V2)) -> U51(isNeList(activate(V1)), activate(V2))
  isNePal(V) -> U61(isQid(activate(V)))
  isNePal(n____(I, n____(P, I))) -> U71(isQid(activate(I)), activate(P))
  isPal(V) -> U81(isNePal(activate(V)))
  isPal(n__nil) -> tt
  isQid(n__a) -> tt
  isQid(n__e) -> tt
  isQid(n__i) -> tt
  isQid(n__o) -> tt
  isQid(n__u) -> tt
  nil -> n__nil
  o -> n__o
  u -> n__u
  
   the pairs 
  activate#(n____(X1, X2)) -> activate#(X1)
  activate#(n____(X1, X2)) -> activate#(X2)
  
  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)]
  polynomial interpretration over naturals with negative constants
  Pol(activate#(x_1)) = 1
  Pol(n____(x_1, x_2)) = 1 + x_2 + x_1
  problem when orienting DPs
  cannot orient pair activate#(n____(X1, X2)) -> activate#(X1) strictly:
  [(activate#(n____(X1, X2)),0),(n____(X1, X2),0)] >mu [(activate#(X1),0),(X1,0)] could not be ensured