YES

Prover = TRS(tech=PATTERN_RULES, nb_unfoldings=unlimited, max_nb_unfolded_rules=200)

** BEGIN proof argument **
All the DP problems were proved finite.
As all the involved DP processors are sound,
the TRS under analysis terminates.
** END proof argument **

** BEGIN proof description **
## Searching for a generalized rewrite rule
(a rule whose right-hand side contains a variable
that does not occur in the left-hand side)...
No generalized rewrite rule found!

## Applying the DP framework...
## Round 1:
  ## DP problem: 
  Dependency pairs = [ack^#(s(_0),0) -> ack^#(_0,s(0)), ack^#(s(_0),s(_1)) -> ack^#(_0,ack(s(_0),_1)), ack^#(s(_0),s(_1)) -> ack^#(s(_0),_1)]
  TRS = {ack(0,_0) -> s(_0), ack(s(_0),0) -> ack(_0,s(0)), ack(s(_0),s(_1)) -> ack(_0,ack(s(_0),_1))}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations... Failed!
    ## Trying with lexicographic path orders...
      The constraints are satisfied by the lexicographic path order using the precedence:
      ack > [0, s], s > [0]
      and the argument filtering:
      {ack:[0, 1], s:[0], ack^#:[0, 1]}
  This DP problem is finite.

** END proof description **

Proof stopped at iteration 0
Number of unfolded rules generated by this proof = 0
Number of unfolded rules generated by all the parallel proofs = 94