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:
  
  int#(s(x), s(y)) -> int#(x, y)
  int#(0, s(y)) -> int#(s(0), s(y))
  rules:
  
  int(s(x), 0) -> nil
  int(x, x) -> cons(x, nil)
  int(s(x), s(y)) -> intlist(int(x, y))
  int(0, s(y)) -> cons(0, int(s(0), s(y)))
  intlist(nil) -> nil
  intlist(cons(x, y)) -> cons(s(x), intlist(y))
  intlist(cons(x, nil)) -> cons(s(x), nil)
  
   the pairs 
  int#(s(x), s(y)) -> int#(x, y)
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MAX and the level mapping defined by 
  pi(int#) = [(1,0),(2,0)]
  Argument Filter: 
  pi(int#/2) = [1,2]
  pi(0/0) = []
  pi(s/1) = [1]
  
  RPO with the following precedence
  precedence(int#[2]) = 0
  precedence(0[0]) = 0
  precedence(s[1]) = 0
  
  precedence(_) = 0
  and the following status
  status(int#[2]) = mul
  status(0[0]) = mul
  status(s[1]) = mul
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair int#(0, s(y)) -> int#(s(0), s(y)) weakly:
  [(0,0),(s(y),0)] >=mu [(s(0),0),(s(y),0)] could not be ensured