ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.6: error below the reduction pair processor
  1.1.6.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
   pairs:
   
   if#(mark(X1), X2, X3) -> if#(X1, X2, X3)
   if#(X1, mark(X2), X3) -> if#(X1, X2, X3)
   if#(X1, X2, mark(X3)) -> if#(X1, X2, X3)
   if#(X1, active(X2), X3) -> if#(X1, X2, X3)
   if#(X1, X2, active(X3)) -> if#(X1, X2, X3)
   rules:
   
   active(minus(0, Y)) -> mark(0)
   active(minus(s(X), s(Y))) -> mark(minus(X, Y))
   active(geq(X, 0)) -> mark(true)
   active(geq(0, s(Y))) -> mark(false)
   active(geq(s(X), s(Y))) -> mark(geq(X, Y))
   active(div(0, s(Y))) -> mark(0)
   active(div(s(X), s(Y))) -> mark(if(geq(X, Y), s(div(minus(X, Y), s(Y))), 0))
   active(if(true, X, Y)) -> mark(X)
   active(if(false, X, Y)) -> mark(Y)
   div(mark(X1), X2) -> div(X1, X2)
   div(X1, mark(X2)) -> div(X1, X2)
   div(active(X1), X2) -> div(X1, X2)
   div(X1, active(X2)) -> div(X1, X2)
   geq(mark(X1), X2) -> geq(X1, X2)
   geq(X1, mark(X2)) -> geq(X1, X2)
   geq(active(X1), X2) -> geq(X1, X2)
   geq(X1, active(X2)) -> geq(X1, X2)
   if(mark(X1), X2, X3) -> if(X1, X2, X3)
   if(X1, mark(X2), X3) -> if(X1, X2, X3)
   if(X1, X2, mark(X3)) -> if(X1, X2, X3)
   if(active(X1), X2, X3) -> if(X1, X2, X3)
   if(X1, active(X2), X3) -> if(X1, X2, X3)
   if(X1, X2, active(X3)) -> if(X1, X2, X3)
   mark(minus(X1, X2)) -> active(minus(X1, X2))
   mark(0) -> active(0)
   mark(s(X)) -> active(s(mark(X)))
   mark(geq(X1, X2)) -> active(geq(X1, X2))
   mark(true) -> active(true)
   mark(false) -> active(false)
   mark(div(X1, X2)) -> active(div(mark(X1), X2))
   mark(if(X1, X2, X3)) -> active(if(mark(X1), X2, X3))
   minus(mark(X1), X2) -> minus(X1, X2)
   minus(X1, mark(X2)) -> minus(X1, X2)
   minus(active(X1), X2) -> minus(X1, X2)
   minus(X1, active(X2)) -> minus(X1, X2)
   s(mark(X)) -> s(X)
   s(active(X)) -> s(X)
   
    the pairs 
   if#(X1, active(X2), X3) -> if#(X1, X2, X3)
   if#(X1, X2, active(X3)) -> if#(X1, X2, X3)
   
   could not apply the generic root reduction pair processor with the following
   SCNP-version with mu = MS and the level mapping defined by 
   pi(if#) = [(2,2),(3,3)]
   polynomial interpretration over naturals with negative constants
   Pol(if#(x_1, x_2, x_3)) = 0
   Pol(mark(x_1)) = x_1
   Pol(active(x_1)) = 1 + x_1
   problem when orienting DPs
   cannot orient pair if#(X1, mark(X2), X3) -> if#(X1, X2, X3) weakly:
   [(mark(X2),2),(X3,3)] >=mu [(X2,2),(X3,3)] could not be ensured