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