Term Rewriting System R:
[f, x]
app(app(iterate, f), x) -> app(app(cons, x), app(app(iterate, f), app(f, x)))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

APP(app(iterate, f), x) -> APP(app(cons, x), app(app(iterate, f), app(f, x)))
APP(app(iterate, f), x) -> APP(cons, x)
APP(app(iterate, f), x) -> APP(app(iterate, f), app(f, x))
APP(app(iterate, f), x) -> APP(f, x)

Furthermore, R contains one SCC. 


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


Dependency Pairs:

APP(app(iterate, f), x) -> APP(f, x)
APP(app(iterate, f), x) -> APP(app(iterate, f), app(f, x))


Rule:


app(app(iterate, f), x) -> app(app(cons, x), app(app(iterate, f), app(f, x)))


Strategy:

innermost




The following dependency pair can be strictly oriented:

APP(app(iterate, f), x) -> APP(f, x)


There are no usable rules w.r.t. the AFS that need to be oriented.
Used ordering: Lexicographic Path Order with Precedence:
trivial

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


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
           →DP Problem 2
             ↳Non Termination


Dependency Pair:

APP(app(iterate, f), x) -> APP(app(iterate, f), app(f, x))


Rule:


app(app(iterate, f), x) -> app(app(cons, x), app(app(iterate, f), app(f, x)))


Strategy:

innermost




Found an infinite P-chain over R:
P =

APP(app(iterate, f), x) -> APP(app(iterate, f), app(f, x))

R =

app(app(iterate, f), x) -> app(app(cons, x), app(app(iterate, f), app(f, x)))

s = APP(app(iterate, f), x)
evaluates to t =APP(app(iterate, f), app(f, x))

Thus, s starts an infinite chain as s matches t.

Innermost Non-Termination of R could be shown.
Duration:
0:00 minutes