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