Certification Problem
Input (TPDB TRS_Standard/SK90/2.57)
The rewrite relation of the following TRS is considered.
|
f(g(h(x,y)),f(a,a)) |
→ |
f(h(x,x),g(f(y,a))) |
(1) |
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#(g(h(x,y)),f(a,a)) |
→ |
f#(y,a) |
(2) |
|
f#(g(h(x,y)),f(a,a)) |
→ |
f#(h(x,x),g(f(y,a))) |
(3) |
1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.