Term Rewriting System R:
[y, x, f]
app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) -> app(app(f, x), y)
add -> app(curry, plus)

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

APP(app(plus, app(s, x)), y) -> APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)
APP(app(plus, app(s, x)), y) -> APP(plus, x)
APP(app(app(curry, f), x), y) -> APP(app(f, x), y)
APP(app(app(curry, f), x), y) -> APP(f, x)
ADD -> APP(curry, plus)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Argument Filtering and Ordering


Dependency Pairs:

APP(app(app(curry, f), x), y) -> APP(f, x)
APP(app(app(curry, f), x), y) -> APP(app(f, x), y)
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)


Rules:


app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) -> app(app(f, x), y)
add -> app(curry, plus)





The following dependency pairs can be strictly oriented:

APP(app(app(curry, f), x), y) -> APP(f, x)
APP(app(app(curry, f), x), y) -> APP(app(f, x), y)
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)


The following rules can be oriented:

app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) -> app(app(f, x), y)
add -> app(curry, plus)


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
add > curry
add > app
add > plus

resulting in one new DP problem.
Used Argument Filtering System:
APP(x1, x2) -> APP(x1, x2)
app(x1, x2) -> app(x1, x2)
add -> add


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
           →DP Problem 2
             ↳Dependency Graph


Dependency Pair:


Rules:


app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(app(app(curry, f), x), y) -> app(app(f, x), y)
add -> app(curry, plus)





Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:00 minutes