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:
  
  U21#(tt, V2) -> isList#(activate(V2))
  U41#(tt, V2) -> isNeList#(activate(V2))
  U51#(tt, V2) -> isList#(activate(V2))
  isList#(V) -> isNeList#(activate(V))
  isList#(n____(V1, V2)) -> U21#(isList(activate(V1)), activate(V2))
  isList#(n____(V1, V2)) -> isList#(activate(V1))
  isNeList#(n____(V1, V2)) -> U41#(isList(activate(V1)), activate(V2))
  isNeList#(n____(V1, V2)) -> isList#(activate(V1))
  isNeList#(n____(V1, V2)) -> U51#(isNeList(activate(V1)), activate(V2))
  isNeList#(n____(V1, V2)) -> isNeList#(activate(V1))
  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)) -> __(X1, 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, __(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 
  U21#(tt, V2) -> isList#(activate(V2))
  isList#(n____(V1, V2)) -> U21#(isList(activate(V1)), activate(V2))
  isList#(n____(V1, V2)) -> isList#(activate(V1))
  isNeList#(n____(V1, V2)) -> U41#(isList(activate(V1)), activate(V2))
  isNeList#(n____(V1, V2)) -> isList#(activate(V1))
  isNeList#(n____(V1, V2)) -> U51#(isNeList(activate(V1)), activate(V2))
  isNeList#(n____(V1, V2)) -> isNeList#(activate(V1))
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MS and the level mapping defined by 
  pi(U21#) = [(1,0),(2,8)]
  pi(isList#) = [(epsilon,0),(1,1)]
  pi(isNeList#) = [(epsilon,0),(1,1)]
  pi(U41#) = [(1,0),(2,1)]
  pi(U51#) = [(1,0),(2,1)]
  Argument Filter: 
  pi(U21#/2) = []
  pi(tt/0) = []
  pi(isList#/1) = []
  pi(activate/1) = 1
  pi(isNeList#/1) = []
  pi(n____/2) = [1,2]
  pi(U41#/2) = 2
  pi(isList/1) = []
  pi(U51#/2) = 2
  pi(isNeList/1) = []
  pi(n__nil/0) = []
  pi(nil/0) = []
  pi(__/2) = [1,2]
  pi(n__a/0) = []
  pi(a/0) = []
  pi(n__e/0) = []
  pi(e/0) = []
  pi(n__i/0) = []
  pi(i/0) = []
  pi(n__o/0) = []
  pi(o/0) = []
  pi(n__u/0) = []
  pi(u/0) = []
  pi(U11/1) = []
  pi(U21/2) = 1
  pi(U31/1) = []
  pi(isQid/1) = []
  pi(U41/2) = 1
  pi(U51/2) = 1
  pi(U42/1) = 1
  pi(U22/1) = 1
  pi(U52/1) = []
  
  RPO with the following precedence
  precedence(U21#[2]) = 1
  precedence(tt[0]) = 1
  precedence(isList#[1]) = 1
  precedence(isNeList#[1]) = 1
  precedence(n____[2]) = 2
  precedence(isList[1]) = 1
  precedence(isNeList[1]) = 1
  precedence(n__nil[0]) = 3
  precedence(nil[0]) = 3
  precedence(__[2]) = 2
  precedence(n__a[0]) = 4
  precedence(a[0]) = 4
  precedence(n__e[0]) = 1
  precedence(e[0]) = 1
  precedence(n__i[0]) = 5
  precedence(i[0]) = 5
  precedence(n__o[0]) = 6
  precedence(o[0]) = 6
  precedence(n__u[0]) = 7
  precedence(u[0]) = 7
  precedence(U11[1]) = 1
  precedence(U31[1]) = 1
  precedence(isQid[1]) = 0
  precedence(U52[1]) = 1
  
  precedence(_) = 0
  and the following status
  status(U21#[2]) = lex
  status(tt[0]) = lex
  status(isList#[1]) = lex
  status(isNeList#[1]) = lex
  status(n____[2]) = lex
  status(isList[1]) = lex
  status(isNeList[1]) = lex
  status(n__nil[0]) = lex
  status(nil[0]) = lex
  status(__[2]) = lex
  status(n__a[0]) = lex
  status(a[0]) = lex
  status(n__e[0]) = lex
  status(e[0]) = lex
  status(n__i[0]) = lex
  status(i[0]) = lex
  status(n__o[0]) = lex
  status(o[0]) = lex
  status(n__u[0]) = lex
  status(u[0]) = lex
  status(U11[1]) = lex
  status(U31[1]) = lex
  status(isQid[1]) = lex
  status(U52[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair U41#(tt, V2) -> isNeList#(activate(V2)) weakly:
  [(tt,0),(V2,1)] >=mu [(isNeList#(activate(V2)),0),(activate(V2),1)] could not be ensured