ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.4: 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, V) -> U12(isPalListKind(activate(V)), activate(V))
  U12(tt, V) -> U13(isNeList(activate(V)))
  U13(tt) -> tt
  U21(tt, V1, V2) -> U22(isPalListKind(activate(V1)), activate(V1), activate(V2))
  U22(tt, V1, V2) -> U23(isPalListKind(activate(V2)), activate(V1), activate(V2))
  U23(tt, V1, V2) -> U24(isPalListKind(activate(V2)), activate(V1), activate(V2))
  U24(tt, V1, V2) -> U25(isList(activate(V1)), activate(V2))
  U25(tt, V2) -> U26(isList(activate(V2)))
  U26(tt) -> tt
  U31(tt, V) -> U32(isPalListKind(activate(V)), activate(V))
  U32(tt, V) -> U33(isQid(activate(V)))
  U33(tt) -> tt
  U41(tt, V1, V2) -> U42(isPalListKind(activate(V1)), activate(V1), activate(V2))
  U42(tt, V1, V2) -> U43(isPalListKind(activate(V2)), activate(V1), activate(V2))
  U43(tt, V1, V2) -> U44(isPalListKind(activate(V2)), activate(V1), activate(V2))
  U44(tt, V1, V2) -> U45(isList(activate(V1)), activate(V2))
  U45(tt, V2) -> U46(isNeList(activate(V2)))
  U46(tt) -> tt
  U51(tt, V1, V2) -> U52(isPalListKind(activate(V1)), activate(V1), activate(V2))
  U52(tt, V1, V2) -> U53(isPalListKind(activate(V2)), activate(V1), activate(V2))
  U53(tt, V1, V2) -> U54(isPalListKind(activate(V2)), activate(V1), activate(V2))
  U54(tt, V1, V2) -> U55(isNeList(activate(V1)), activate(V2))
  U55(tt, V2) -> U56(isList(activate(V2)))
  U56(tt) -> tt
  U61(tt, V) -> U62(isPalListKind(activate(V)), activate(V))
  U62(tt, V) -> U63(isQid(activate(V)))
  U63(tt) -> tt
  U71(tt, I, P) -> U72(isPalListKind(activate(I)), activate(P))
  U72(tt, P) -> U73(isPal(activate(P)), activate(P))
  U73(tt, P) -> U74(isPalListKind(activate(P)))
  U74(tt) -> tt
  U81(tt, V) -> U82(isPalListKind(activate(V)), activate(V))
  U82(tt, V) -> U83(isNePal(activate(V)))
  U83(tt) -> tt
  U91(tt, V2) -> U92(isPalListKind(activate(V2)))
  U92(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(isPalListKind(activate(V)), activate(V))
  isList(n__nil) -> tt
  isList(n____(V1, V2)) -> U21(isPalListKind(activate(V1)), activate(V1), activate(V2))
  isNeList(V) -> U31(isPalListKind(activate(V)), activate(V))
  isNeList(n____(V1, V2)) -> U41(isPalListKind(activate(V1)), activate(V1), activate(V2))
  isNeList(n____(V1, V2)) -> U51(isPalListKind(activate(V1)), activate(V1), activate(V2))
  isNePal(V) -> U61(isPalListKind(activate(V)), activate(V))
  isNePal(n____(I, n____(P, I))) -> U71(isQid(activate(I)), activate(I), activate(P))
  isPal(V) -> U81(isPalListKind(activate(V)), activate(V))
  isPal(n__nil) -> tt
  isPalListKind(n__a) -> tt
  isPalListKind(n__e) -> tt
  isPalListKind(n__i) -> tt
  isPalListKind(n__nil) -> tt
  isPalListKind(n__o) -> tt
  isPalListKind(n__u) -> tt
  isPalListKind(n____(V1, V2)) -> U91(isPalListKind(activate(V1)), activate(V2))
  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