TRS:
 {   d(x) -> e(u(x)),
  d(u(x)) -> c(x),
  c(u(x)) -> b(x),
  v(e(x)) -> x,
  b(u(x)) -> a(e(x))}
 RPO Product:
  Quasi-Precedence:
  d > c ~ b
  c ~ b
  
  Qed


TRS:
 {   d(x) -> e(u(x)),
  d(u(x)) -> c(x),
  c(u(x)) -> b(x),
  v(e(x)) -> x,
  b(u(x)) -> a(e(x))}
 Cdiprover:
  Interpretation class: quasisimplemixed
  Complexity bound: POLYTIME COMPUTABLE IF RPO-TERMINATING
  a(X6) = + 1*X6 + 1
  v(X5) = + 0*X5^2 + 0 + 1*X5
  b(X4) = + 0*X4^2 + 0 + 2*X4
  c(X3) = + 0*X3^2 + 0 + 2*X3
  d(X2) = + 2*X2^2 + 3 + 2*X2
  u(X1) = + 1*X1 + 2
  e(X0) = + 1*X0 + 1
  
  Qed