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#(0, s(y)) -> int#(s(0), s(y))
  int#(s(x), s(y)) -> int#(x, y)
  rules:
  
  int(0, 0) -> .(0, nil)
  int(0, s(y)) -> .(0, int(s(0), s(y)))
  int(s(x), 0) -> nil
  int(s(x), s(y)) -> int_list(int(x, y))
  int_list(nil) -> nil
  int_list(.(x, y)) -> .(s(x), int_list(y))
  
   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 = MS and the level mapping defined by 
  pi(int#) = [(epsilon,0),(2,0)]
  Argument Filter: 
  pi(int#/2) = []
  pi(s/1) = [1]
  pi(0/0) = []
  
  RPO with the following precedence
  precedence(int#[2]) = 0
  precedence(s[1]) = 1
  precedence(0[0]) = 2
  
  precedence(_) = 0
  and the following status
  status(int#[2]) = lex
  status(s[1]) = lex
  status(0[0]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair int#(0, s(y)) -> int#(s(0), s(y)) weakly:
  [(int#(0, s(y)),0),(s(y),0)] >=mu [(int#(s(0), s(y)),0),(s(y),0)] could not be ensured