Certification Problem
Input (TPDB TRS_Innermost/Mixed_innermost/bn111)
The rewrite relation of the following TRS is considered.
|
f(f(X,Y),Z) |
→ |
f(X,f(Y,Z)) |
(1) |
|
f(X,f(Y,Z)) |
→ |
f(Y,Y) |
(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#(f(X,Y),Z) |
→ |
f#(X,f(Y,Z)) |
(3) |
|
f#(f(X,Y),Z) |
→ |
f#(Y,Z) |
(4) |
|
f#(X,f(Y,Z)) |
→ |
f#(Y,Y) |
(5) |
1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.