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