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:
  
  cons#(mark(X1), X2) -> cons#(X1, X2)
  cons#(X1, mark(X2)) -> cons#(X1, X2)
  cons#(active(X1), X2) -> cons#(X1, X2)
  cons#(X1, active(X2)) -> cons#(X1, X2)
  rules:
  
  active(from(X)) -> mark(cons(X, from(s(X))))
  active(length(nil)) -> mark(0)
  active(length(cons(X, Y))) -> mark(s(length1(Y)))
  active(length1(X)) -> mark(length(X))
  cons(mark(X1), X2) -> cons(X1, X2)
  cons(X1, mark(X2)) -> cons(X1, X2)
  cons(active(X1), X2) -> cons(X1, X2)
  cons(X1, active(X2)) -> cons(X1, X2)
  from(mark(X)) -> from(X)
  from(active(X)) -> from(X)
  length(mark(X)) -> length(X)
  length(active(X)) -> length(X)
  length1(mark(X)) -> length1(X)
  length1(active(X)) -> length1(X)
  mark(from(X)) -> active(from(mark(X)))
  mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
  mark(s(X)) -> active(s(mark(X)))
  mark(length(X)) -> active(length(X))
  mark(nil) -> active(nil)
  mark(0) -> active(0)
  mark(length1(X)) -> active(length1(X))
  s(mark(X)) -> s(X)
  s(active(X)) -> s(X)
  
   the pairs 
  cons#(active(X1), X2) -> cons#(X1, 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(cons#) = [(epsilon,0),(1,1)]
  Argument Filter: 
  pi(cons#/2) = []
  pi(mark/1) = 1
  pi(active/1) = [1]
  
  RPO with the following precedence
  precedence(cons#[2]) = 0
  precedence(active[1]) = 1
  
  precedence(_) = 0
  and the following status
  status(cons#[2]) = lex
  status(active[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair cons#(mark(X1), X2) -> cons#(X1, X2) weakly:
  [(cons#(mark(X1), X2),0),(mark(X1),1)] >=mu [(cons#(X1, X2),0),(X1,1)] could not be ensured