YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

a(a(x0))	→	b(b(b(x0)))
a(x0)	→	c(d(x0))
b(b(x0))	→	c(c(c(x0)))
c(c(x0))	→	d(d(d(x0)))
e(d(x0))	→	a(b(c(d(e(x0)))))
b(x0)	→	d(d(x0))
e(c(x0))	→	b(a(a(e(x0))))
c(d(d(x0)))	→	a(x0)

Proof

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

a^#(a(x0))	→	b^#(x0)
a^#(a(x0))	→	b^#(b(x0))
a^#(a(x0))	→	b^#(b(b(x0)))
a^#(x0)	→	c^#(d(x0))
b^#(b(x0))	→	c^#(x0)
b^#(b(x0))	→	c^#(c(x0))
b^#(b(x0))	→	c^#(c(c(x0)))
e^#(d(x0))	→	e^#(x0)
e^#(d(x0))	→	c^#(d(e(x0)))
e^#(d(x0))	→	b^#(c(d(e(x0))))
e^#(d(x0))	→	a^#(b(c(d(e(x0)))))
e^#(c(x0))	→	e^#(x0)
e^#(c(x0))	→	a^#(e(x0))
e^#(c(x0))	→	a^#(a(e(x0)))
e^#(c(x0))	→	b^#(a(a(e(x0))))
c^#(d(d(x0)))	→	a^#(x0)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pairs

b^#(b(x0))	→	c^#(c(c(x0)))
c^#(d(d(x0)))	→	a^#(x0)
a^#(x0)	→	c^#(d(x0))
a^#(a(x0))	→	b^#(b(b(x0)))
b^#(b(x0))	→	c^#(c(x0))
b^#(b(x0))	→	c^#(x0)
a^#(a(x0))	→	b^#(b(x0))
a^#(a(x0))	→	b^#(x0)

1.1.1 Reduction Pair Processor with Usable Rules

Using the linear polynomial interpretation over the arctic semiring over the integers

[b(x₁)]	=	9 · x₁ + -∞
[c(x₁)]	=	6 · x₁ + -∞
[a^#(x₁)]	=	10 · x₁ + -∞
[a(x₁)]	=	14 · x₁ + -∞
[c^#(x₁)]	=	3 · x₁ + -∞
[b^#(x₁)]	=	6 · x₁ + -∞
[d(x₁)]	=	4 · x₁ + -∞

together with the usable rules

c(c(x0))	→	d(d(d(x0)))
c(d(d(x0)))	→	a(x0)
a(a(x0))	→	b(b(b(x0)))
a(x0)	→	c(d(x0))
b(b(x0))	→	c(c(c(x0)))
b(x0)	→	d(d(x0))

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

b^#(b(x0))	→	c^#(c(c(x0)))
a^#(a(x0))	→	b^#(b(b(x0)))

remain.

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.