ceta_eq: termination proof not accepted
1: error below switch to dependency pairs
1.1: error when applying the reduction pair processor to remove from the DP problem
 pairs:
 
 div#(X, e) -> i#(X)
 i#(div(X, Y)) -> div#(Y, X)
 div#(div(X, Y), Z) -> div#(Y, div(i(X), Z))
 div#(div(X, Y), Z) -> div#(i(X), Z)
 div#(div(X, Y), Z) -> i#(X)
 rules:
 
 div(X, e) -> i(X)
 div(div(X, Y), Z) -> div(Y, div(i(X), Z))
 i(div(X, Y)) -> div(Y, X)
 
  the pairs 
 i#(div(X, Y)) -> div#(Y, X)
 div#(div(X, Y), Z) -> div#(Y, div(i(X), Z))
 div#(div(X, Y), Z) -> div#(i(X), Z)
 div#(div(X, Y), Z) -> i#(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(div#) = [(epsilon,0),(1,0)]
 pi(i#) = [(epsilon,0),(1,0)]
 Argument Filter: 
 pi(div#/2) = []
 pi(e/0) = []
 pi(i#/1) = []
 pi(div/2) = [1,2]
 pi(i/1) = [1]
 
 RPO with the following precedence
 precedence(div#[2]) = 1
 precedence(e[0]) = 2
 precedence(i#[1]) = 1
 precedence(div[2]) = 0
 precedence(i[1]) = 0
 
 precedence(_) = 0
 and the following status
 status(div#[2]) = lex
 status(e[0]) = lex
 status(i#[1]) = lex
 status(div[2]) = lex
 status(i[1]) = lex
 
 status(_) = lex
 
 problem when orienting DPs
 cannot orient pair div#(X, e) -> i#(X) weakly:
 [(div#(X, e),0),(X,0)] >=mu [(i#(X),0),(X,0)] could not be ensured