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:
  
  app#(f, app(f, x)) -> app#(g, app(f, x))
  app#(g, app(g, x)) -> app#(f, x)
  rules:
  
  app(f, app(f, x)) -> app(g, app(f, x))
  app(g, app(g, x)) -> app(f, x)
  app(app(map, fun), nil) -> nil
  app(app(map, fun), app(app(cons, x), xs)) -> app(app(cons, app(fun, x)), app(app(map, fun), xs))
  app(app(filter, fun), nil) -> nil
  app(app(filter, fun), app(app(cons, x), xs)) -> app(app(app(app(filter2, app(fun, x)), fun), x), xs)
  app(app(app(app(filter2, true), fun), x), xs) -> app(app(cons, x), app(app(filter, fun), xs))
  app(app(app(app(filter2, false), fun), x), xs) -> app(app(filter, fun), xs)
  
   the pairs 
  app#(g, app(g, x)) -> app#(f, x)
  
  could not apply the generic root reduction pair processor with the following
  SCNP-version with mu = MS and the level mapping defined by 
  pi(app#) = [(1,2),(2,0)]
  Argument Filter: 
  pi(app#/2) = [1]
  pi(g/0) = []
  pi(app/2) = [2]
  pi(f/0) = []
  
  RPO with the following precedence
  precedence(app#[2]) = 0
  precedence(g[0]) = 2
  precedence(app[2]) = 1
  precedence(f[0]) = 2
  
  precedence(_) = 0
  and the following status
  status(app#[2]) = lex
  status(g[0]) = lex
  status(app[2]) = lex
  status(f[0]) = lex
  
  status(_) = lex
  
  problem when orienting DPs
  cannot orient pair app#(f, app(f, x)) -> app#(g, app(f, x)) weakly:
  [(f,2),(app(f, x),0)] >=mu [(g,2),(app(f, x),0)] could not be ensured