ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error below the dependency graph processor
 1.1.3: error below the reduction pair processor
  1.1.3.1: error below the dependency graph processor
   1.1.3.1.1: error when applying the reduction pair processor with usable rules to remove from the DP problem
    pairs:
    
    -#(O(x), O(y)) -> -#(x, y)
    -#(I(x), O(y)) -> -#(x, y)
    rules:
    
    +(0, x) -> x
    +(x, 0) -> x
    +(O(x), O(y)) -> O(+(x, y))
    +(O(x), I(y)) -> I(+(x, y))
    +(I(x), O(y)) -> I(+(x, y))
    +(I(x), I(y)) -> O(+(+(x, y), I(0)))
    +(x, +(y, z)) -> +(+(x, y), z)
    -(x, 0) -> x
    -(0, x) -> 0
    -(O(x), O(y)) -> O(-(x, y))
    -(O(x), I(y)) -> I(-(-(x, y), I(1)))
    -(I(x), O(y)) -> I(-(x, y))
    -(I(x), I(y)) -> O(-(x, y))
    BS(L(x)) -> true
    BS(N(x, l, r)) -> and(and(ge(x, Max(l)), ge(Min(r), x)), and(BS(l), BS(r)))
    Log(x) -> -(Log'(x), I(0))
    Log'(0) -> 0
    Log'(I(x)) -> +(Log'(x), I(0))
    Log'(O(x)) -> if(ge(x, I(0)), +(Log'(x), I(0)), 0)
    Max(L(x)) -> x
    Max(N(x, l, r)) -> Max(r)
    Min(L(x)) -> x
    Min(N(x, l, r)) -> Min(l)
    O(0) -> 0
    Size(L(x)) -> I(0)
    Size(N(x, l, r)) -> +(+(Size(l), Size(r)), I(1))
    Val(L(x)) -> x
    Val(N(x, l, r)) -> x
    WB(L(x)) -> true
    WB(N(x, l, r)) -> and(if(ge(Size(l), Size(r)), ge(I(0), -(Size(l), Size(r))), ge(I(0), -(Size(r), Size(l)))), and(WB(l), WB(r)))
    and(x, true) -> x
    and(x, false) -> false
    ge(O(x), O(y)) -> ge(x, y)
    ge(O(x), I(y)) -> not(ge(y, x))
    ge(I(x), O(y)) -> ge(x, y)
    ge(I(x), I(y)) -> ge(x, y)
    ge(x, 0) -> true
    ge(0, O(x)) -> ge(0, x)
    ge(0, I(x)) -> false
    if(true, x, y) -> x
    if(false, x, y) -> y
    not(true) -> false
    not(false) -> true
    
     the pairs 
    -#(I(x), O(y)) -> -#(x, y)
    
    could not apply the generic root reduction pair processor with the following
    SCNP-version with mu = MS and the level mapping defined by 
    pi(-#) = [(epsilon,0),(1,2)]
    polynomial interpretration over naturals with negative constants
    Pol(-#(x_1, x_2)) = x_2
    Pol(I(x_1)) = 1 + x_1
    Pol(O(x_1)) = x_1
    problem when orienting DPs
    cannot orient pair -#(O(x), O(y)) -> -#(x, y) weakly:
    [(-#(O(x), O(y)),0),(O(x),2)] >=mu [(-#(x, y),0),(x,2)] could not be ensured