YES
Termination Proof
Termination Proof
by ttt2 (version ttt2 1.15)
Input
The rewrite relation of the following TRS is considered.
|
a(a(x0)) |
→ |
b(b(b(x0))) |
|
b(b(x0)) |
→ |
c(c(c(x0))) |
|
c(c(x0)) |
→ |
d(d(d(x0))) |
|
b(x0) |
→ |
d(d(x0)) |
|
c(d(d(x0))) |
→ |
a(x0) |
Proof
1 Rule Removal
Using the
linear polynomial interpretation over the arctic semiring over the integers
| [b(x1)] |
= |
9 ·
x1 +
-∞
|
| [d(x1)] |
= |
4 ·
x1 +
-∞
|
| [a(x1)] |
= |
14 ·
x1 +
-∞
|
| [c(x1)] |
= |
6 ·
x1 +
-∞
|
the
rules
|
b(b(x0)) |
→ |
c(c(c(x0))) |
|
c(c(x0)) |
→ |
d(d(d(x0))) |
|
c(d(d(x0))) |
→ |
a(x0) |
remain.
1.1 Rule Removal
Using the
linear polynomial interpretation over the arctic semiring over the integers
| [b(x1)] |
= |
14 ·
x1 +
-∞
|
| [d(x1)] |
= |
4 ·
x1 +
-∞
|
| [a(x1)] |
= |
0 ·
x1 +
-∞
|
| [c(x1)] |
= |
9 ·
x1 +
-∞
|
all rules could be removed.
1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.