Certification Problem
Input (TPDB TRS_Standard/Der95/02)
The rewrite relation of the following TRS is considered.
|
.(1,x) |
→ |
x |
(1) |
|
.(x,1) |
→ |
x |
(2) |
|
.(i(x),x) |
→ |
1 |
(3) |
|
.(x,i(x)) |
→ |
1 |
(4) |
|
i(1) |
→ |
1 |
(5) |
|
i(i(x)) |
→ |
x |
(6) |
|
.(i(y),.(y,z)) |
→ |
z |
(7) |
|
.(y,.(i(y),z)) |
→ |
z |
(8) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by NaTT @ termCOMP 2023)
1 Dependency Pair Transformation
The set of initial dependency pairs is empty, and hence the TRS is
terminating.