Certification Problem
Input (TPDB SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-532)
The rewrite relation of the following TRS is considered.
a(a(b(x1))) |
→ |
c(x1) |
(1) |
a(c(x1)) |
→ |
b(c(a(a(x1)))) |
(2) |
b(c(x1)) |
→ |
x1 |
(3) |
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
b(a(a(x1))) |
→ |
c(x1) |
(4) |
c(a(x1)) |
→ |
a(a(c(b(x1)))) |
(5) |
c(b(x1)) |
→ |
x1 |
(6) |
1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
b#(a(a(x1))) |
→ |
c#(x1) |
(7) |
c#(a(x1)) |
→ |
b#(x1) |
(8) |
c#(a(x1)) |
→ |
c#(b(x1)) |
(9) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over the arctic semiring over the integers
[c#(x1)] |
= |
0 · x1 + 0 |
[a(x1)] |
= |
1 · x1 + 4 |
[b#(x1)] |
= |
1 · x1 + -16 |
[b(x1)] |
= |
-1 · x1 + 1 |
[c(x1)] |
= |
1 · x1 +
-∞ |
together with the usable
rules
b(a(a(x1))) |
→ |
c(x1) |
(4) |
c(a(x1)) |
→ |
a(a(c(b(x1)))) |
(5) |
c(b(x1)) |
→ |
x1 |
(6) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
b#(a(a(x1))) |
→ |
c#(x1) |
(7) |
c#(a(x1)) |
→ |
c#(b(x1)) |
(9) |
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.