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(treemap, f), app(app(node, x), xs)) -> app#(f, x)
  app#(app(treemap, f), app(app(node, x), xs)) -> app#(app(map, app(treemap, f)), xs)
  rules:
  
  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(treemap, f), app(app(node, x), xs)) -> app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs))
  
   the 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)
  
  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,0),(2,2)]
  polynomial interpretration over naturals with negative constants
  Pol(app#(x_1, x_2)) = 1 + x_2
  Pol(app(x_1, x_2)) = x_2 + x_1
  Pol(map) = 0
  Pol(cons) = 1
  Pol(treemap) = 0
  Pol(node) = 0
  problem when orienting DPs
  cannot orient pair app#(app(treemap, f), app(app(node, x), xs)) -> app#(f, x) weakly:
  [(app(treemap, f),0),(app(app(node, x), xs),2)] >=mu [(f,0),(x,2)] could not be ensured