YES

Prover = TRS(tech=GUIDED_UNF_TRIPLES, nb_unfoldings=unlimited, unfold_variables=false, max_nb_coefficients=12, max_nb_unfolded_rules=-1, strategy=LEFTMOST_NE)

** 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 = [app^#(app(plus,app(s,_0)),_1) -> app^#(app(plus,_0),_1), app^#(app(app(curry,_0),_1),_2) -> app^#(app(_0,_1),_2), app^#(app(app(curry,_0),_1),_2) -> app^#(_0,_1)]
  TRS = {app(app(plus,0),_0) -> _0, app(app(plus,app(s,_0)),_1) -> app(s,app(app(plus,_0),_1)), app(app(app(curry,_0),_1),_2) -> app(app(_0,_1),_2), add -> app(curry,plus)}
    ## Trying with homeomorphic embeddings... Failed!
    ## Trying with polynomial interpretations...
      The constraints are satisfied by the polynomials:
      {app(_0,_1):[_0 * _1], 0:[1], s:[2], add:[2], plus:[1], curry:[2], app^#(_0,_1):[_0 * _1]}
      for all instantiations of the variables with values greater than or equal to mu = 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 = 66