YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

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

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pairs

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

1.1.1 Reduction Pair Processor with Usable Rules

Using the linear polynomial interpretation over (2 x 2)-matrices with strict dimension 1 over the arctic semiring over the integers

[c^#(x₁)]

0	0
-∞	-∞

· x₁ +

1	-∞
-∞	-∞

[c(x₁)]

-∞	0
0	-∞

· x₁ +

0	-∞
0	-∞

[a^#(x₁)]

0	0
-∞	-∞

· x₁ +

0	-∞
-∞	-∞

[a(x₁)]

-∞	0
0	2

· x₁ +

0	-∞
2	-∞

[b(x₁)]

0	2
1	0

· x₁ +

2	-∞
2	-∞

together with the usable rules

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

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

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

remain.

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pair

a^#(a(x0))

→

a^#(c(c(x0)))

1.1.1.1.1 Reduction Pair Processor with Usable Rules

Using the linear polynomial interpretation over (2 x 2)-matrices with strict dimension 1 over the arctic semiring over the integers

[c(x₁)]

-∞	0
0	-∞

· x₁ +

0	-∞
-∞	-∞

[a^#(x₁)]

1	0
-∞	-∞

· x₁ +

0	-∞
-∞	-∞

[a(x₁)]

2	0
0	-∞

· x₁ +

2	-∞
0	-∞

[b(x₁)]

0	2
2	0

· x₁ +

2	-∞
2	-∞

together with the usable rules

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

(w.r.t. the implicit argument filter of the reduction pair), all pairs could be removed.

1.1.1.1.1.1 P is empty

There are no pairs anymore.