Certification Problem
Input (TPDB TRS_Standard/Rubio_04/p266)
The rewrite relation of the following TRS is considered.
|
f(f(X)) |
→ |
f(a(b(f(X)))) |
(1) |
|
f(a(g(X))) |
→ |
b(X) |
(2) |
|
b(X) |
→ |
a(X) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by NaTT @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
f#(f(X)) |
→ |
f#(a(b(f(X)))) |
(4) |
|
f#(f(X)) |
→ |
b#(f(X)) |
(5) |
|
f#(a(g(X))) |
→ |
b#(X) |
(6) |
1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.