Term Rewriting System R:
[x, y, p, xs]
app(app(app(if, true), x), y) -> x
app(app(app(if, true), x), y) -> y
app(app(takeWhile, p), nil) -> nil
app(app(takeWhile, p), app(app(cons, x), xs)) -> app(app(app(if, app(p, x)), app(app(cons, x), app(app(takeWhile, p), xs))), nil)
app(app(dropWhile, p), nil) -> nil
app(app(dropWhile, p), app(app(cons, x), xs)) -> app(app(app(if, app(p, x)), app(app(dropWhile, p), xs)), app(app(cons, x), xs))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(app(app(if, app(p, x)), app(app(cons, x), app(app(takeWhile, p), xs))), nil)
APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(app(if, app(p, x)), app(app(cons, x), app(app(takeWhile, p), xs)))
APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(if, app(p, x))
APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(p, x)
APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(app(cons, x), app(app(takeWhile, p), xs))
APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(app(takeWhile, p), xs)
APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(app(app(if, app(p, x)), app(app(dropWhile, p), xs)), app(app(cons, x), xs))
APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(app(if, app(p, x)), app(app(dropWhile, p), xs))
APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(if, app(p, x))
APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(p, x)
APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(app(dropWhile, p), xs)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(app(dropWhile, p), xs)
APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(p, x)
APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(app(if, app(p, x)), app(app(dropWhile, p), xs))
APP(app(dropWhile, p), app(app(cons, x), xs)) -> APP(app(app(if, app(p, x)), app(app(dropWhile, p), xs)), app(app(cons, x), xs))
APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(app(takeWhile, p), xs)
APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(p, x)
APP(app(takeWhile, p), app(app(cons, x), xs)) -> APP(app(if, app(p, x)), app(app(cons, x), app(app(takeWhile, p), xs)))


Rules:


app(app(app(if, true), x), y) -> x
app(app(app(if, true), x), y) -> y
app(app(takeWhile, p), nil) -> nil
app(app(takeWhile, p), app(app(cons, x), xs)) -> app(app(app(if, app(p, x)), app(app(cons, x), app(app(takeWhile, p), xs))), nil)
app(app(dropWhile, p), nil) -> nil
app(app(dropWhile, p), app(app(cons, x), xs)) -> app(app(app(if, app(p, x)), app(app(dropWhile, p), xs)), app(app(cons, x), xs))


Strategy:

innermost



Innermost Termination of R could not be shown.
Duration:
0:03 minutes