TRS:
 {a(b(x)) -> b(a(x)),
  a(c(x)) -> x}
 RPO Product:
  Quasi-Precedence:
  empty
  
  Qed


TRS:
 {a(b(x)) -> b(a(x)),
  a(c(x)) -> x}
 Cdiprover:
  Interpretation class: quasisimplemixed
  Complexity bound: POLYTIME COMPUTABLE IF RPO-TERMINATING
  c(X2) = + 1*X2 + 1
  a(X1) = + 0*X1^2 + 0 + 2*X1
  b(X0) = + 1*X0 + 1
  
  Qed