Term Rewriting System R:
[x]
f(f(a, x), a) -> f(f(f(x, a), f(a, a)), a)

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(f(a, x), a) -> F(f(f(x, a), f(a, a)), a)
F(f(a, x), a) -> F(f(x, a), f(a, a))
F(f(a, x), a) -> F(x, a)
F(f(a, x), a) -> F(a, a)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Usable Rules (Innermost)


Dependency Pair:

F(f(a, x), a) -> F(x, a)


Rule:


f(f(a, x), a) -> f(f(f(x, a), f(a, a)), a)


Strategy:

innermost




As we are in the innermost case, we can delete all 1 non-usable-rules.


   R
DPs
       →DP Problem 1
UsableRules
           →DP Problem 2
Argument Filtering and Ordering


Dependency Pair:

F(f(a, x), a) -> F(x, a)


Rule:

none


Strategy:

innermost




The following dependency pair can be strictly oriented:

F(f(a, x), a) -> F(x, a)


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:
F(x1, x2) -> F(x1, x2)
f(x1, x2) -> f(x1, x2)


   R
DPs
       →DP Problem 1
UsableRules
           →DP Problem 2
AFS
             ...
               →DP Problem 3
Dependency Graph


Dependency Pair:


Rule:

none


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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