Certification Problem
Input (TPDB SRS_Relative/Zantema_06_relative/rel06)
The relative rewrite relation R/S is considered where R is the following TRS
a(x1) |
→ |
b(c(x1)) |
(1) |
a(b(x1)) |
→ |
b(a(x1)) |
(2) |
a(c(x1)) |
→ |
c(a(x1)) |
(3) |
and S is the following TRS.
d(c(x1)) |
→ |
d(a(x1)) |
(4) |
d(a(x1)) |
→ |
d(c(b(x1))) |
(5) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Rule Removal
Using the
matrix interpretations of dimension 2 with strict dimension 1 over the integers
[a(x1)] |
= |
+ · x1
|
[b(x1)] |
= |
+ · x1
|
[c(x1)] |
= |
+ · x1
|
[d(x1)] |
= |
+ · x1
|
all of the following rules can be deleted.
1.1 Rule Removal
Using the
matrix interpretations of dimension 2 with strict dimension 1 over the integers
[a(x1)] |
= |
+ · x1
|
[b(x1)] |
= |
+ · x1
|
[c(x1)] |
= |
+ · x1
|
[d(x1)] |
= |
+ · x1
|
all of the following rules can be deleted.
1.1.1 Closure Under Flat Contexts
Using the flat contexts
{a(☐), b(☐), d(☐), c(☐)}
We obtain the transformed TRS
a(a(b(x1))) |
→ |
a(b(a(x1))) |
(6) |
b(a(b(x1))) |
→ |
b(b(a(x1))) |
(7) |
d(a(b(x1))) |
→ |
d(b(a(x1))) |
(8) |
c(a(b(x1))) |
→ |
c(b(a(x1))) |
(9) |
d(c(x1)) |
→ |
d(a(x1)) |
(4) |
d(a(x1)) |
→ |
d(c(b(x1))) |
(5) |
1.1.1.1 Semantic Labeling
Root-labeling is applied.
We obtain the labeled TRS
aa(ab(ba(x1))) |
→ |
ab(ba(aa(x1))) |
(10) |
aa(ab(bb(x1))) |
→ |
ab(ba(ab(x1))) |
(11) |
aa(ab(bd(x1))) |
→ |
ab(ba(ad(x1))) |
(12) |
aa(ab(bc(x1))) |
→ |
ab(ba(ac(x1))) |
(13) |
ba(ab(ba(x1))) |
→ |
bb(ba(aa(x1))) |
(14) |
ba(ab(bb(x1))) |
→ |
bb(ba(ab(x1))) |
(15) |
ba(ab(bd(x1))) |
→ |
bb(ba(ad(x1))) |
(16) |
ba(ab(bc(x1))) |
→ |
bb(ba(ac(x1))) |
(17) |
da(ab(ba(x1))) |
→ |
db(ba(aa(x1))) |
(18) |
da(ab(bb(x1))) |
→ |
db(ba(ab(x1))) |
(19) |
da(ab(bd(x1))) |
→ |
db(ba(ad(x1))) |
(20) |
da(ab(bc(x1))) |
→ |
db(ba(ac(x1))) |
(21) |
ca(ab(ba(x1))) |
→ |
cb(ba(aa(x1))) |
(22) |
ca(ab(bb(x1))) |
→ |
cb(ba(ab(x1))) |
(23) |
ca(ab(bd(x1))) |
→ |
cb(ba(ad(x1))) |
(24) |
ca(ab(bc(x1))) |
→ |
cb(ba(ac(x1))) |
(25) |
dc(ca(x1)) |
→ |
da(aa(x1)) |
(26) |
dc(cb(x1)) |
→ |
da(ab(x1)) |
(27) |
dc(cd(x1)) |
→ |
da(ad(x1)) |
(28) |
dc(cc(x1)) |
→ |
da(ac(x1)) |
(29) |
da(aa(x1)) |
→ |
dc(cb(ba(x1))) |
(30) |
da(ab(x1)) |
→ |
dc(cb(bb(x1))) |
(31) |
da(ad(x1)) |
→ |
dc(cb(bd(x1))) |
(32) |
da(ac(x1)) |
→ |
dc(cb(bc(x1))) |
(33) |
1.1.1.1.1 Rule Removal
Using the
linear polynomial interpretation over the naturals
[aa(x1)] |
= |
1 · x1
|
[ab(x1)] |
= |
1 · x1
|
[ba(x1)] |
= |
1 · x1
|
[bb(x1)] |
= |
1 · x1
|
[bd(x1)] |
= |
1 · x1
|
[ad(x1)] |
= |
1 · x1
|
[bc(x1)] |
= |
1 · x1
|
[ac(x1)] |
= |
1 · x1
|
[da(x1)] |
= |
1 · x1
|
[db(x1)] |
= |
1 · x1
|
[ca(x1)] |
= |
1 + 1 · x1
|
[cb(x1)] |
= |
1 · x1
|
[dc(x1)] |
= |
1 · x1
|
[cd(x1)] |
= |
1 + 1 · x1
|
[cc(x1)] |
= |
1 + 1 · x1
|
all of the following rules can be deleted.
ca(ab(ba(x1))) |
→ |
cb(ba(aa(x1))) |
(22) |
ca(ab(bb(x1))) |
→ |
cb(ba(ab(x1))) |
(23) |
ca(ab(bd(x1))) |
→ |
cb(ba(ad(x1))) |
(24) |
ca(ab(bc(x1))) |
→ |
cb(ba(ac(x1))) |
(25) |
dc(ca(x1)) |
→ |
da(aa(x1)) |
(26) |
dc(cd(x1)) |
→ |
da(ad(x1)) |
(28) |
dc(cc(x1)) |
→ |
da(ac(x1)) |
(29) |
1.1.1.1.1.1 Rule Removal
Using the
linear polynomial interpretation over the naturals
[aa(x1)] |
= |
1 · x1
|
[ab(x1)] |
= |
1 · x1
|
[ba(x1)] |
= |
1 · x1
|
[bb(x1)] |
= |
1 · x1
|
[bd(x1)] |
= |
1 · x1
|
[ad(x1)] |
= |
1 · x1
|
[bc(x1)] |
= |
1 · x1
|
[ac(x1)] |
= |
1 · x1
|
[da(x1)] |
= |
1 + 1 · x1
|
[db(x1)] |
= |
1 · x1
|
[dc(x1)] |
= |
1 · x1
|
[cb(x1)] |
= |
1 + 1 · x1
|
all of the following rules can be deleted.
da(ab(ba(x1))) |
→ |
db(ba(aa(x1))) |
(18) |
da(ab(bb(x1))) |
→ |
db(ba(ab(x1))) |
(19) |
da(ab(bd(x1))) |
→ |
db(ba(ad(x1))) |
(20) |
da(ab(bc(x1))) |
→ |
db(ba(ac(x1))) |
(21) |
1.1.1.1.1.1.1 Rule Removal
Using the
matrix interpretations of dimension 2 with strict dimension 1 over the integers
[aa(x1)] |
= |
+ · x1
|
[ab(x1)] |
= |
+ · x1
|
[ba(x1)] |
= |
+ · x1
|
[bb(x1)] |
= |
+ · x1
|
[bd(x1)] |
= |
+ · x1
|
[ad(x1)] |
= |
+ · x1
|
[bc(x1)] |
= |
+ · x1
|
[ac(x1)] |
= |
+ · x1
|
[dc(x1)] |
= |
+ · x1
|
[cb(x1)] |
= |
+ · x1
|
[da(x1)] |
= |
+ · x1
|
all of the following rules can be deleted.
aa(ab(bd(x1))) |
→ |
ab(ba(ad(x1))) |
(12) |
ba(ab(bd(x1))) |
→ |
bb(ba(ad(x1))) |
(16) |
1.1.1.1.1.1.1.1 Rule Removal
Using the
linear polynomial interpretation over the naturals
[aa(x1)] |
= |
1 · x1
|
[ab(x1)] |
= |
1 · x1
|
[ba(x1)] |
= |
1 · x1
|
[bb(x1)] |
= |
1 · x1
|
[bc(x1)] |
= |
1 · x1
|
[ac(x1)] |
= |
1 · x1
|
[dc(x1)] |
= |
1 · x1
|
[cb(x1)] |
= |
1 · x1
|
[da(x1)] |
= |
1 · x1
|
[ad(x1)] |
= |
1 + 1 · x1
|
[bd(x1)] |
= |
1 · x1
|
all of the following rules can be deleted.
da(ad(x1)) |
→ |
dc(cb(bd(x1))) |
(32) |
1.1.1.1.1.1.1.1.1 Rule Removal
Using the
matrix interpretations of dimension 2 with strict dimension 1 over the integers
[aa(x1)] |
= |
+ · x1
|
[ab(x1)] |
= |
+ · x1
|
[ba(x1)] |
= |
+ · x1
|
[bb(x1)] |
= |
+ · x1
|
[bc(x1)] |
= |
+ · x1
|
[ac(x1)] |
= |
+ · x1
|
[dc(x1)] |
= |
+ · x1
|
[cb(x1)] |
= |
+ · x1
|
[da(x1)] |
= |
+ · x1
|
all of the following rules can be deleted.
da(aa(x1)) |
→ |
dc(cb(ba(x1))) |
(30) |
1.1.1.1.1.1.1.1.1.1 Rule Removal
Using the
matrix interpretations of dimension 2 with strict dimension 1 over the integers
[aa(x1)] |
= |
+ · x1
|
[ab(x1)] |
= |
+ · x1
|
[ba(x1)] |
= |
+ · x1
|
[bb(x1)] |
= |
+ · x1
|
[bc(x1)] |
= |
+ · x1
|
[ac(x1)] |
= |
+ · x1
|
[dc(x1)] |
= |
+ · x1
|
[cb(x1)] |
= |
+ · x1
|
[da(x1)] |
= |
+ · x1
|
all of the following rules can be deleted.
da(ac(x1)) |
→ |
dc(cb(bc(x1))) |
(33) |
1.1.1.1.1.1.1.1.1.1.1 Rule Removal
Using the
linear polynomial interpretation over the naturals
[aa(x1)] |
= |
1 + 1 · x1
|
[ab(x1)] |
= |
1 · x1
|
[ba(x1)] |
= |
1 + 1 · x1
|
[bb(x1)] |
= |
1 · x1
|
[bc(x1)] |
= |
1 + 1 · x1
|
[ac(x1)] |
= |
1 · x1
|
[dc(x1)] |
= |
1 · x1
|
[cb(x1)] |
= |
1 · x1
|
[da(x1)] |
= |
1 · x1
|
all of the following rules can be deleted.
aa(ab(bc(x1))) |
→ |
ab(ba(ac(x1))) |
(13) |
ba(ab(bc(x1))) |
→ |
bb(ba(ac(x1))) |
(17) |
1.1.1.1.1.1.1.1.1.1.1.1 Rule Removal
Using the
matrix interpretations of dimension 2 with strict dimension 1 over the integers
[aa(x1)] |
= |
+ · x1
|
[ab(x1)] |
= |
+ · x1
|
[ba(x1)] |
= |
+ · x1
|
[bb(x1)] |
= |
+ · x1
|
[dc(x1)] |
= |
+ · x1
|
[cb(x1)] |
= |
+ · x1
|
[da(x1)] |
= |
+ · x1
|
all of the following rules can be deleted.
aa(ab(ba(x1))) |
→ |
ab(ba(aa(x1))) |
(10) |
aa(ab(bb(x1))) |
→ |
ab(ba(ab(x1))) |
(11) |
ba(ab(ba(x1))) |
→ |
bb(ba(aa(x1))) |
(14) |
ba(ab(bb(x1))) |
→ |
bb(ba(ab(x1))) |
(15) |
1.1.1.1.1.1.1.1.1.1.1.1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.