ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.3: error when applying the reduction pair processor with usable rules to remove from the DP problem
  pairs:
  
  app#(h, app(app(cons, x), y)) -> app#(h, app(g, app(app(cons, x), y)))
  rules:
  
  app(f, app(s, x)) -> app(f, x)
  app(g, app(app(cons, 0), y)) -> app(g, y)
  app(g, app(app(cons, app(s, x)), y)) -> app(s, x)
  app(h, app(app(cons, x), y)) -> app(h, app(g, app(app(cons, x), y)))
  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#(h, app(app(cons, x), y)) -> app#(h, app(g, app(app(cons, x), y)))
  
  could not apply the generic reduction pair processor with the following
  Argument Filter: 
  pi(app#/2) = [1,2]
  pi(h/0) = []
  pi(app/2) = [1]
  pi(cons/0) = []
  pi(g/0) = []
  pi(0/0) = []
  pi(s/0) = []
  
  RPO with the following precedence
  precedence(app#[2]) = 0
  precedence(h[0]) = 0
  precedence(app[2]) = 1
  precedence(cons[0]) = 2
  precedence(g[0]) = 2
  precedence(0[0]) = 3
  precedence(s[0]) = 2
  
  precedence(_) = 0
  and the following status
  status(app#[2]) = mul
  status(h[0]) = mul
  status(app[2]) = mul
  status(cons[0]) = mul
  status(g[0]) = mul
  status(0[0]) = mul
  status(s[0]) = mul
  
  status(_) = lex
  
  problem when orienting (usable) rules
  could not orient app(g, app(app(cons, app(s, x)), y)) >= app(s, x)
  pi( app(g, app(app(cons, app(s, x)), y)) ) = app(g)
  pi( app(s, x) ) = app(s)
  could not orient app(g) >=RPO app(s)