Certification Problem

Input (TPDB SRS_Relative/Waldmann_06_relative/r7)

The relative rewrite relation R/S is considered where R is the following TRS

b(b(b(x1))) → x1 (1)
c(c(c(x1))) → a(a(x1)) (2)

and S is the following TRS.

a(x1) → a(c(b(x1))) (3)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Closure Under Flat Contexts

Using the flat contexts

{b(☐), c(☐), a(☐)}

We obtain the transformed TRS
b(b(b(b(x1)))) → b(x1) (4)
c(b(b(b(x1)))) → c(x1) (5)
a(b(b(b(x1)))) → a(x1) (6)
b(c(c(c(x1)))) → b(a(a(x1))) (7)
c(c(c(c(x1)))) → c(a(a(x1))) (8)
a(c(c(c(x1)))) → a(a(a(x1))) (9)
a(x1) → a(c(b(x1))) (3)

1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS
bb(bb(bb(bb(x1)))) → bb(x1) (10)
bb(bb(bb(bc(x1)))) → bc(x1) (11)
bb(bb(bb(ba(x1)))) → ba(x1) (12)
cb(bb(bb(bb(x1)))) → cb(x1) (13)
cb(bb(bb(bc(x1)))) → cc(x1) (14)
cb(bb(bb(ba(x1)))) → ca(x1) (15)
ab(bb(bb(bb(x1)))) → ab(x1) (16)
ab(bb(bb(bc(x1)))) → ac(x1) (17)
ab(bb(bb(ba(x1)))) → aa(x1) (18)
bc(cc(cc(cb(x1)))) → ba(aa(ab(x1))) (19)
bc(cc(cc(cc(x1)))) → ba(aa(ac(x1))) (20)
bc(cc(cc(ca(x1)))) → ba(aa(aa(x1))) (21)
cc(cc(cc(cb(x1)))) → ca(aa(ab(x1))) (22)
cc(cc(cc(cc(x1)))) → ca(aa(ac(x1))) (23)
cc(cc(cc(ca(x1)))) → ca(aa(aa(x1))) (24)
ac(cc(cc(cb(x1)))) → aa(aa(ab(x1))) (25)
ac(cc(cc(cc(x1)))) → aa(aa(ac(x1))) (26)
ac(cc(cc(ca(x1)))) → aa(aa(aa(x1))) (27)
ab(x1) → ac(cb(bb(x1))) (28)
ac(x1) → ac(cb(bc(x1))) (29)
aa(x1) → ac(cb(ba(x1))) (30)

1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[bb(x1)] = 1 + 1 · x1
[bc(x1)] = 1 · x1
[ba(x1)] = 1 · x1
[cb(x1)] = 1 · x1
[cc(x1)] = 1 + 1 · x1
[ca(x1)] = 1 + 1 · x1
[ab(x1)] = 1 + 1 · x1
[ac(x1)] = 1 · x1
[aa(x1)] = 1 · x1
all of the following rules can be deleted.
bb(bb(bb(bb(x1)))) → bb(x1) (10)
bb(bb(bb(bc(x1)))) → bc(x1) (11)
bb(bb(bb(ba(x1)))) → ba(x1) (12)
cb(bb(bb(bb(x1)))) → cb(x1) (13)
cb(bb(bb(bc(x1)))) → cc(x1) (14)
cb(bb(bb(ba(x1)))) → ca(x1) (15)
ab(bb(bb(bb(x1)))) → ab(x1) (16)
ab(bb(bb(bc(x1)))) → ac(x1) (17)
ab(bb(bb(ba(x1)))) → aa(x1) (18)
bc(cc(cc(cb(x1)))) → ba(aa(ab(x1))) (19)
bc(cc(cc(cc(x1)))) → ba(aa(ac(x1))) (20)
bc(cc(cc(ca(x1)))) → ba(aa(aa(x1))) (21)
cc(cc(cc(cb(x1)))) → ca(aa(ab(x1))) (22)
cc(cc(cc(cc(x1)))) → ca(aa(ac(x1))) (23)
cc(cc(cc(ca(x1)))) → ca(aa(aa(x1))) (24)
ac(cc(cc(cb(x1)))) → aa(aa(ab(x1))) (25)
ac(cc(cc(cc(x1)))) → aa(aa(ac(x1))) (26)
ac(cc(cc(ca(x1)))) → aa(aa(aa(x1))) (27)

1.1.1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.