YES

The TRS could be proven terminating. The proof took 19 ms.

The following DP Processors were used


Problem 1 was processed with processor SubtermCriterion (5ms).

Problem 1: SubtermCriterion

Dependency Pair Problem

Dependency Pairs

app#(app(apply, f), x) → app#(f, x)

Rewrite Rules

app(app(apply, f), x) → app(f, x)

Original Signature

Termination of terms over the following signature is verified: app, apply

Strategy

Projection

The following projection was used:

Thus, the following dependency pairs are removed:

app#(app(apply, f), x) → app#(f, x)