Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/PALINDROME_nosorts-noand_L)
The rewrite relation of the following TRS is considered.
|
__(__(X,Y),Z) |
→ |
__(X,__(Y,Z)) |
(1) |
|
__(X,nil) |
→ |
X |
(2) |
|
__(nil,X) |
→ |
X |
(3) |
|
U11(tt) |
→ |
U12(tt) |
(4) |
|
U12(tt) |
→ |
tt |
(5) |
|
isNePal(__(I,__(P,I))) |
→ |
U11(tt) |
(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.
|
__#(__(X,Y),Z) |
→ |
__#(X,__(Y,Z)) |
(7) |
|
__#(__(X,Y),Z) |
→ |
__#(Y,Z) |
(8) |
|
isNePal#(__(I,__(P,I))) |
→ |
U11#(tt) |
(9) |
|
U11#(tt) |
→ |
U12#(tt) |
(10) |
1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.