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