Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex4_7_56_Bor03_Z)
The rewrite relation of the following TRS is considered.
from(X) |
→ |
cons(X,n__from(s(X))) |
(1) |
after(0,XS) |
→ |
XS |
(2) |
after(s(N),cons(X,XS)) |
→ |
after(N,activate(XS)) |
(3) |
from(X) |
→ |
n__from(X) |
(4) |
activate(n__from(X)) |
→ |
from(X) |
(5) |
activate(X) |
→ |
X |
(6) |
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.
after#(s(N),cons(X,XS)) |
→ |
after#(N,activate(XS)) |
(7) |
after#(s(N),cons(X,XS)) |
→ |
activate#(XS) |
(8) |
activate#(n__from(X)) |
→ |
from#(X) |
(9) |
1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.