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