Certification Problem
Input (TPDB SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-346)
The rewrite relation of the following TRS is considered.
|
a(x1) |
→ |
b(x1) |
(1) |
|
a(b(x1)) |
→ |
x1 |
(2) |
|
c(c(a(x1))) |
→ |
a(c(a(c(c(x1))))) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by ttt2 @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
c#(c(a(x1))) |
→ |
c#(x1) |
(4) |
|
c#(c(a(x1))) |
→ |
c#(c(x1)) |
(5) |
|
c#(c(a(x1))) |
→ |
a#(c(c(x1))) |
(6) |
|
c#(c(a(x1))) |
→ |
c#(a(c(c(x1)))) |
(7) |
|
c#(c(a(x1))) |
→ |
a#(c(a(c(c(x1))))) |
(8) |
1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
1st
component contains the
pair
|
c#(c(a(x1))) |
→ |
c#(c(x1)) |
(5) |
|
c#(c(a(x1))) |
→ |
c#(x1) |
(4) |
|
c#(c(a(x1))) |
→ |
c#(a(c(c(x1)))) |
(7) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the linear polynomial interpretation over (2 x 2)-matrices with strict dimension 1
over the arctic semiring over the integers
| [c#(x1)] |
= |
· x1 +
|
| [b(x1)] |
= |
· x1 +
|
| [a(x1)] |
= |
· x1 +
|
| [c(x1)] |
= |
· x1 +
|
together with the usable
rules
|
a(x1) |
→ |
b(x1) |
(1) |
|
a(b(x1)) |
→ |
x1 |
(2) |
|
c(c(a(x1))) |
→ |
a(c(a(c(c(x1))))) |
(3) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
|
c#(c(a(x1))) |
→ |
c#(c(x1)) |
(5) |
|
c#(c(a(x1))) |
→ |
c#(a(c(c(x1)))) |
(7) |
could be deleted.
1.1.1.1 Size-Change Termination
Using size-change termination in combination with
the subterm criterion
one obtains the following initial size-change graphs.
|
c#(c(a(x1))) |
→ |
c#(x1) |
(4) |
|
| 1 |
> |
1 |
As there is no critical graph in the transitive closure, there are no infinite chains.