Certification Problem
Input (TPDB SRS_Standard/Zantema_04/z110)
The rewrite relation of the following TRS is considered.
|
a(a(x1)) |
→ |
b(x1) |
(1) |
|
b(a(x1)) |
→ |
a(b(x1)) |
(2) |
|
b(b(c(x1))) |
→ |
c(a(x1)) |
(3) |
|
b(b(x1)) |
→ |
a(a(a(x1))) |
(4) |
|
c(a(x1)) |
→ |
b(a(c(x1))) |
(5) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
a#(a(x1)) |
→ |
b#(x1) |
(6) |
|
b#(a(x1)) |
→ |
a#(b(x1)) |
(7) |
|
b#(a(x1)) |
→ |
b#(x1) |
(8) |
|
b#(b(c(x1))) |
→ |
c#(a(x1)) |
(9) |
|
b#(b(c(x1))) |
→ |
a#(x1) |
(10) |
|
b#(b(x1)) |
→ |
a#(a(a(x1))) |
(11) |
|
b#(b(x1)) |
→ |
a#(a(x1)) |
(12) |
|
b#(b(x1)) |
→ |
a#(x1) |
(13) |
|
c#(a(x1)) |
→ |
b#(a(c(x1))) |
(14) |
|
c#(a(x1)) |
→ |
a#(c(x1)) |
(15) |
|
c#(a(x1)) |
→ |
c#(x1) |
(16) |
1.1 Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
| [a#(x1)] |
= |
1 · x1
|
| [a(x1)] |
= |
1 · x1
|
| [b#(x1)] |
= |
1 · x1
|
| [b(x1)] |
= |
1 · x1
|
| [c(x1)] |
= |
1 + 1 · x1
|
| [c#(x1)] |
= |
1 + 1 · x1
|
the
pair
|
b#(b(c(x1))) |
→ |
a#(x1) |
(10) |
could be deleted.
1.1.1 Monotonic Reduction Pair Processor
Using the linear polynomial interpretation over the naturals
| [a(x1)] |
= |
2 + 1 · x1
|
| [b(x1)] |
= |
3 + 1 · x1
|
| [c(x1)] |
= |
3 + 3 · x1
|
| [a#(x1)] |
= |
1 · x1
|
| [b#(x1)] |
= |
2 + 1 · x1
|
| [c#(x1)] |
= |
2 + 3 · x1
|
the
pairs
|
b#(a(x1)) |
→ |
a#(b(x1)) |
(7) |
|
b#(a(x1)) |
→ |
b#(x1) |
(8) |
|
b#(b(x1)) |
→ |
a#(a(a(x1))) |
(11) |
|
b#(b(x1)) |
→ |
a#(a(x1)) |
(12) |
|
b#(b(x1)) |
→ |
a#(x1) |
(13) |
|
c#(a(x1)) |
→ |
b#(a(c(x1))) |
(14) |
|
c#(a(x1)) |
→ |
a#(c(x1)) |
(15) |
|
c#(a(x1)) |
→ |
c#(x1) |
(16) |
and
the
rules
|
a(a(x1)) |
→ |
b(x1) |
(1) |
|
c(a(x1)) |
→ |
b(a(c(x1))) |
(5) |
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.