f(

TRS

↳Dependency Pair Analysis

F(x) -> F(g(x))

Furthermore,

TRS

↳DPs

→DP Problem 1

↳Non Termination

**F( x) -> F(g(x))**

f(x) -> f(g(x))

Found an infinite P-chain over R:

P =

F(x) -> F(g(x))

R =

f(x) -> f(g(x))

s = F(

evaluates to t =F(g(

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

Duration:

0:00 minutes