ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.2: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  max#(N(L(s(x)), L(s(y)))) -> max#(N(L(x), L(y)))
  rules:
  
  max(L(x)) -> x
  max(N(L(0), L(y))) -> y
  max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
  max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))
  
   the pairs 
  max#(N(L(s(x)), L(s(y)))) -> max#(N(L(x), L(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(max#) = [(epsilon,0),(1,1)]
  Argument Filter: 
  pi(max#/1) = []
  pi(N/2) = [1,2]
  pi(L/1) = 1
  pi(s/1) = [1]
  
  RPO with the following precedence
  precedence(N[2]) = 0
  precedence(s[1]) = 1
  precedence(max#[1]) = 2
  
  precedence(_) = 0
  and the following status
  status(N[2]) = lex
  status(s[1]) = lex
  status(max#[1]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair max#(N(L(s(x)), L(s(y)))) -> max#(N(L(x), L(y))) strictly:
  [(max#(N(L(s(x)), L(s(y)))),0),(N(L(s(x)), L(s(y))),1)] >mu [(max#(N(L(x), L(y))),0),(N(L(x), L(y)),1)] could not be ensured