TRS:
 { and(tt(), X) -> activate(X),
   plus(N, 0()) -> N,
  plus(N, s(M)) -> s(plus(N, M)),
    activate(X) -> X}
 Cdiprover:
  Interpretation class: pizerosimplemixed
  Complexity bound: POLYTIME COMPUTABLE
  s(X5) = + 1*X5 + 1
  0 = + 1
  plus(X4, X3) = + 0*X4^2 + 2*X3^2 + 2*X4 + 0 + 1*X3 + 0*X3*X4
  tt = + 1
  and(X2, X1) = + 0*X2^2 + 0*X1^2 + 3*X2 + 0 + 2*X1 + 0*X1*X2
  activate(X0) = + 0*X0^2 + 2 + 2*X0
  
  Qed