Certification Problem
Input (TPDB SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-134)
The rewrite relation of the following TRS is considered.
a(x1) |
→ |
x1 |
(1) |
a(b(x1)) |
→ |
x1 |
(2) |
b(a(x1)) |
→ |
a(a(b(c(x1)))) |
(3) |
c(c(x1)) |
→ |
b(x1) |
(4) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by ttt2 @ termCOMP 2023)
1 String Reversal
Since only unary symbols occur, one can reverse all terms and obtains the TRS
a(x1) |
→ |
x1 |
(1) |
b(a(x1)) |
→ |
x1 |
(5) |
a(b(x1)) |
→ |
c(b(a(a(x1)))) |
(6) |
c(c(x1)) |
→ |
b(x1) |
(4) |
1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
a#(b(x1)) |
→ |
a#(x1) |
(7) |
a#(b(x1)) |
→ |
a#(a(x1)) |
(8) |
a#(b(x1)) |
→ |
b#(a(a(x1))) |
(9) |
a#(b(x1)) |
→ |
c#(b(a(a(x1)))) |
(10) |
c#(c(x1)) |
→ |
b#(x1) |
(11) |
1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.