Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z107)

The rewrite relation of the following TRS is considered.

a(a(x1))	→	b(b(b(x1)))	(1)
b(b(x1))	→	c(c(c(x1)))	(2)
c(c(x1))	→	d(d(d(x1)))	(3)
b(x1)	→	d(d(x1))	(4)
c(d(d(x1)))	→	a(x1)	(5)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by NaTT @ termCOMP 2023)

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

b^#(b(x1))	→	c^#(c(x1))	(6)
a^#(a(x1))	→	b^#(b(x1))	(7)
a^#(a(x1))	→	b^#(x1)	(8)
a^#(a(x1))	→	b^#(b(b(x1)))	(9)
b^#(b(x1))	→	c^#(x1)	(10)
b^#(b(x1))	→	c^#(c(c(x1)))	(11)
c^#(d(d(x1)))	→	a^#(x1)	(12)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pair

c^#(d(d(x1)))	→	a^#(x1)	(12)
b^#(b(x1))	→	c^#(c(c(x1)))	(11)
b^#(b(x1))	→	c^#(x1)	(10)
a^#(a(x1))	→	b^#(b(x1))	(7)
a^#(a(x1))	→	b^#(b(b(x1)))	(9)
a^#(a(x1))	→	b^#(x1)	(8)
b^#(b(x1))	→	c^#(c(x1))	(6)

1.1.1 Reduction Pair Processor with Usable Rules

Using the Max-polynomial interpretation

[a(x₁)]	=	x₁ + 42
[d(x₁)]	=	x₁ + 12
[b(x₁)]	=	x₁ + 27
[c(x₁)]	=	x₁ + 18
[c^#(x₁)]	=	x₁ + 0
[a^#(x₁)]	=	x₁ + 23
[b^#(x₁)]	=	x₁ + 10

together with the usable rules

b(x1)	→	d(d(x1))	(4)
a(a(x1))	→	b(b(b(x1)))	(1)
c(c(x1))	→	d(d(d(x1)))	(3)
c(d(d(x1)))	→	a(x1)	(5)
b(b(x1))	→	c(c(c(x1)))	(2)

(w.r.t. the implicit argument filter of the reduction pair), the pairs

c^#(d(d(x1)))	→	a^#(x1)	(12)
b^#(b(x1))	→	c^#(c(c(x1)))	(11)
b^#(b(x1))	→	c^#(x1)	(10)
a^#(a(x1))	→	b^#(b(x1))	(7)
a^#(a(x1))	→	b^#(b(b(x1)))	(9)
a^#(a(x1))	→	b^#(x1)	(8)
b^#(b(x1))	→	c^#(c(x1))	(6)

could be deleted.

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.