Certification Problem
Input (TPDB TRS_Equational/AProVE_AC_04/AC13)
The rewrite relation of the following equational TRS is considered.
|
plus(x,0) |
→ |
x |
(1) |
|
plus(x,i(x)) |
→ |
0 |
(2) |
|
i(0) |
→ |
0 |
(3) |
|
i(i(x)) |
→ |
x |
(4) |
|
i(plus(x,y)) |
→ |
plus(i(x),i(y)) |
(5) |
|
times(x,plus(y,z)) |
→ |
plus(times(x,y),times(x,z)) |
(6) |
|
times(x,0) |
→ |
0 |
(7) |
|
times(x,i(y)) |
→ |
i(times(x,y)) |
(8) |
Associative symbols: plus, times
Commutative symbols: plus, times
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)] |
= |
3 + 1 · x2 + 1 · x1
|
| [times(x1, x2)] |
= |
2 + 2 · x2 + 2 · x1 + 1 · x1 · x2
|
| [0] |
= |
0 |
| [i(x1)] |
= |
1 · x1
|
the
rules
|
plus(x,0) |
→ |
x |
(1) |
|
plus(x,i(x)) |
→ |
0 |
(2) |
|
times(x,plus(y,z)) |
→ |
plus(times(x,y),times(x,z)) |
(6) |
|
times(x,0) |
→ |
0 |
(7) |
can be deleted.
1.1 AC Rule Removal
Using the
non-linear polynomial interpretation over the naturals
| [plus(x1, x2)] |
= |
3 + 1 · x2 + 1 · x1
|
| [times(x1, x2)] |
= |
1 · x2 + 1 · x1 + 2 · x1 · x2
|
| [i(x1)] |
= |
1 + 3 · x1
|
| [0] |
= |
0 |
the
rules
|
i(0) |
→ |
0 |
(3) |
|
i(i(x)) |
→ |
x |
(4) |
|
i(plus(x,y)) |
→ |
plus(i(x),i(y)) |
(5) |
can be deleted.
1.1.1 AC Rule Removal
Using the
non-linear polynomial interpretation over the naturals
| [plus(x1, x2)] |
= |
3 + 3 · x2 + 3 · x1 + 2 · x1 · x2
|
| [times(x1, x2)] |
= |
1 + 2 · x2 + 2 · x1 + 2 · x1 · x2
|
| [i(x1)] |
= |
2 + 1 · x1
|
the
rule
|
times(x,i(y)) |
→ |
i(times(x,y)) |
(8) |
can be deleted.
1.1.1.1 R is empty
There are no rules in the TRS. Hence, it is AC-terminating.