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 = [max^#(N(L(_0),N(_1,_2))) -> max^#(N(_1,_2))]
  TRS = {max(L(_0)) -> _0, max(N(L(0),L(_0))) -> _0, max(N(L(s(_0)),L(s(_1)))) -> s(max(N(L(_0),L(_1)))), max(N(L(_0),N(_1,_2))) -> max(N(L(_0),L(max(N(_1,_2)))))}
    ## Trying with homeomorphic embeddings... Success!
  This DP problem is finite.
  ## DP problem: 
  Dependency pairs = [max^#(N(L(s(_0)),L(s(_1)))) -> max^#(N(L(_0),L(_1)))]
  TRS = {max(L(_0)) -> _0, max(N(L(0),L(_0))) -> _0, max(N(L(s(_0)),L(s(_1)))) -> s(max(N(L(_0),L(_1)))), max(N(L(_0),N(_1,_2))) -> max(N(L(_0),L(max(N(_1,_2)))))}
    ## Trying with homeomorphic embeddings... Success!
  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 = 0