Certification Problem
Input (TPDB TRS_Standard/SK90/2.48)
The rewrite relation of the following TRS is considered.
|
d(x) |
→ |
e(u(x)) |
(1) |
|
d(u(x)) |
→ |
c(x) |
(2) |
|
c(u(x)) |
→ |
b(x) |
(3) |
|
v(e(x)) |
→ |
x |
(4) |
|
b(u(x)) |
→ |
a(e(x)) |
(5) |
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.
|
c#(u(x)) |
→ |
b#(x) |
(6) |
|
d#(u(x)) |
→ |
c#(x) |
(7) |
1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.