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(node, xs)) -> app#(app(maptlist, f), xs)
   app#(app(maptlist, f), app(app(cons, x), xs)) -> app#(app(mapt, f), x)
   app#(app(maptlist, f), app(app(cons, x), xs)) -> app#(app(maptlist, f), xs)
   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(node, xs)) -> app#(app(maptlist, f), xs)
   app#(app(maptlist, f), app(app(cons, x), xs)) -> app#(app(mapt, f), x)
   app#(app(maptlist, f), app(app(cons, x), xs)) -> app#(app(maptlist, f), xs)
   
   could not apply the generic root reduction pair processor with the following
   SCNP-version with mu = MAX and the level mapping defined by 
   pi(app#) = [(epsilon,0)]
   Argument Filter: 
   pi(app#/2) = [1,2]
   pi(app/2) = [1,2]
   pi(mapt/0) = []
   pi(node/0) = []
   pi(maptlist/0) = []
   pi(cons/0) = []
   
   RPO with the following precedence
   precedence(app#[2]) = 1
   precedence(app[2]) = 0
   precedence(mapt[0]) = 1
   precedence(node[0]) = 2
   precedence(maptlist[0]) = 1
   precedence(cons[0]) = 3
   
   precedence(_) = 0
   and the following status
   status(app#[2]) = mul
   status(app[2]) = mul
   status(mapt[0]) = mul
   status(node[0]) = mul
   status(maptlist[0]) = mul
   status(cons[0]) = mul
   
   status(_) = lex
   
   problem when orienting DPs
   cannot orient pair app#(app(mapt, f), app(node, xs)) -> app#(app(maptlist, f), xs) strictly:
   [(app#(app(mapt, f), app(node, xs)),0)] >mu [(app#(app(maptlist, f), xs),0)] could not be ensured