Certification Problem
Input (TPDB SRS_Standard/Zantema_04/z115)
The rewrite relation of the following TRS is considered.
|
a(a(x1)) |
→ |
d(c(x1)) |
(1) |
|
a(b(x1)) |
→ |
c(c(c(x1))) |
(2) |
|
b(b(x1)) |
→ |
a(c(c(x1))) |
(3) |
|
c(c(x1)) |
→ |
b(x1) |
(4) |
|
c(d(x1)) |
→ |
a(a(x1)) |
(5) |
|
d(d(x1)) |
→ |
b(a(c(x1))) |
(6) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by matchbox @ termCOMP 2023)
1 Rule Removal
Using the
matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
| [d(x1)] |
= |
x1 +
|
| [c(x1)] |
= |
x1 +
|
| [b(x1)] |
= |
x1 +
|
| [a(x1)] |
= |
x1 +
|
all of the following rules can be deleted.
|
a(b(x1)) |
→ |
c(c(c(x1))) |
(2) |
|
b(b(x1)) |
→ |
a(c(c(x1))) |
(3) |
|
c(c(x1)) |
→ |
b(x1) |
(4) |
|
d(d(x1)) |
→ |
b(a(c(x1))) |
(6) |
1.1 String Reversal
Since only unary symbols occur, one can reverse all terms and obtains the TRS
|
a(a(x1)) |
→ |
c(d(x1)) |
(7) |
|
d(c(x1)) |
→ |
a(a(x1)) |
(8) |
1.1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
d#(c(x1)) |
→ |
a#(x1) |
(9) |
|
d#(c(x1)) |
→ |
a#(a(x1)) |
(10) |
|
a#(a(x1)) |
→ |
d#(x1) |
(11) |
1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules
Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
| [d(x1)] |
= |
x1 +
|
| [c(x1)] |
= |
x1 +
|
| [a(x1)] |
= |
x1 +
|
| [d#(x1)] |
= |
x1 +
|
| [a#(x1)] |
= |
x1 +
|
together with the usable
rules
|
a(a(x1)) |
→ |
c(d(x1)) |
(7) |
|
d(c(x1)) |
→ |
a(a(x1)) |
(8) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
|
d#(c(x1)) |
→ |
a#(x1) |
(9) |
|
d#(c(x1)) |
→ |
a#(a(x1)) |
(10) |
|
a#(a(x1)) |
→ |
d#(x1) |
(11) |
and
no rules
could be deleted.
1.1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.