Term Rewriting System R:
[x, y, z, u, v]
f(f(x, y, z), u, f(x, y, v)) -> f(x, y, f(z, u, v))
f(x, y, y) -> y
f(x, y, g(y)) -> x
f(x, x, y) -> x
f(g(x), x, y) -> y

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(f(x, y, z), u, f(x, y, v)) -> F(x, y, f(z, u, v))
F(f(x, y, z), u, f(x, y, v)) -> F(z, u, v)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering


Dependency Pairs:

F(f(x, y, z), u, f(x, y, v)) -> F(z, u, v)
F(f(x, y, z), u, f(x, y, v)) -> F(x, y, f(z, u, v))


Rules:


f(f(x, y, z), u, f(x, y, v)) -> f(x, y, f(z, u, v))
f(x, y, y) -> y
f(x, y, g(y)) -> x
f(x, x, y) -> x
f(g(x), x, y) -> y


Strategy:

innermost




The following dependency pairs can be strictly oriented:

F(f(x, y, z), u, f(x, y, v)) -> F(z, u, v)
F(f(x, y, z), u, f(x, y, v)) -> F(x, y, f(z, u, v))


There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
F(x1, x2, x3) -> x1
f(x1, x2, x3) -> f(x1, x2, x3)


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


Dependency Pair:


Rules:


f(f(x, y, z), u, f(x, y, v)) -> f(x, y, f(z, u, v))
f(x, y, y) -> y
f(x, y, g(y)) -> x
f(x, x, y) -> x
f(g(x), x, y) -> y


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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