Certification Problem
Input (TPDB TRS_Equational/AProVE_AC_04/AC51)
The rewrite relation of the following equational TRS is considered.
|
plus(0,y) |
→ |
y |
(1) |
|
plus(s(x),0) |
→ |
s(x) |
(2) |
|
plus(s(x),s(y)) |
→ |
s(plus(s(x),plus(y,0))) |
(3) |
Associative symbols: plus
Commutative symbols: plus
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 AC Rule Removal
Using the
non-linear polynomial interpretation over the naturals
| [plus(x1, x2)] |
= |
1 · x2 + 1 · x1 + 1 · x1 · x2
|
| [0] |
= |
0 |
| [s(x1)] |
= |
1 + 1 · x1
|
the
rule
|
plus(s(x),s(y)) |
→ |
s(plus(s(x),plus(y,0))) |
(3) |
can be deleted.
1.1 AC Rule Removal
Using the
non-linear polynomial interpretation over the naturals
| [plus(x1, x2)] |
= |
1 + 1 · x2 + 1 · x1
|
| [0] |
= |
0 |
| [s(x1)] |
= |
3 + 1 · x1 · x1
|
the
rules
|
plus(0,y) |
→ |
y |
(1) |
|
plus(s(x),0) |
→ |
s(x) |
(2) |
can be deleted.
1.1.1 R is empty
There are no rules in the TRS. Hence, it is AC-terminating.