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:
  
  app#(app(map, f), app(app(cons, x), xs)) -> app#(f, x)
  app#(app(map, f), app(app(cons, x), xs)) -> app#(app(map, f), xs)
  app#(app(filter, f), app(app(cons, x), xs)) -> app#(f, x)
  app#(app(app(app(filter2, true), f), x), xs) -> app#(app(filter, f), xs)
  app#(app(app(app(filter2, false), f), x), xs) -> app#(app(filter, f), xs)
  rules:
  
  app(D, t) -> 1
  app(D, constant) -> 0
  app(D, app(app(+, x), y)) -> app(app(+, app(D, x)), app(D, y))
  app(D, app(app(*, x), y)) -> app(app(+, app(app(*, y), app(D, x))), app(app(*, x), app(D, y)))
  app(D, app(app(-, x), y)) -> app(app(-, app(D, x)), app(D, y))
  app(app(map, f), nil) -> nil
  app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs))
  app(app(filter, f), nil) -> nil
  app(app(filter, f), app(app(cons, x), xs)) -> app(app(app(app(filter2, app(f, x)), f), x), xs)
  app(app(app(app(filter2, true), f), x), xs) -> app(app(cons, x), app(app(filter, f), xs))
  app(app(app(app(filter2, false), f), x), xs) -> app(app(filter, f), xs)
  
   the pairs 
  app#(app(map, f), app(app(cons, x), xs)) -> 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#) = [(epsilon,0),(2,2)]
  polynomial interpretration over naturals with negative constants
  Pol(app#(x_1, x_2)) = x_1
  Pol(app(x_1, x_2)) = x_2 + x_1
  Pol(map) = 1
  Pol(cons) = 0
  Pol(filter) = 0
  Pol(filter2) = 0
  Pol(true) = 0
  Pol(false) = 0
  problem when orienting DPs
  cannot orient pair app#(app(map, f), app(app(cons, x), xs)) -> app#(app(map, f), xs) weakly:
  [(app#(app(map, f), app(app(cons, x), xs)),0),(app(app(cons, x), xs),2)] >=mu [(app#(app(map, f), xs),0),(xs,2)] could not be ensured