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 below the reduction pair processor
  1.1.1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
   pairs:
   
   app#(app(mapt, f), app(leaf, x)) -> app#(f, x)
   rules:
   
   app(app(mapt, f), app(leaf, x)) -> app(leaf, app(f, x))
   app(app(mapt, f), app(node, xs)) -> app(node, app(app(maptlist, f), xs))
   app(app(maptlist, f), nil) -> nil
   app(app(maptlist, f), app(app(cons, x), xs)) -> app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))
   
    the pairs 
   app#(app(mapt, f), app(leaf, 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,0),(2,1)]
   polynomial interpretration over naturals with negative constants
   Pol(app#(x_1, x_2)) = 1
   Pol(app(x_1, x_2)) = x_2 + x_1
   Pol(mapt) = 1
   Pol(leaf) = 0
   problem when orienting DPs
   cannot orient pair app#(app(mapt, f), app(leaf, x)) -> app#(f, x) strictly:
   [(app(mapt, f),0),(app(leaf, x),1)] >mu [(f,0),(x,1)] could not be ensured