Certification Problem

Input (TPDB SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-129)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by AProVE @ termCOMP 2023)

1 Looping derivation

There is a looping derivation.

a b b b b →⁺ b c a b b b b ε

The derivation can be derived as follows.

a b →⁺ b c a a: This is an original rule (OC1).
a b b →⁺ b c a b c a a: The overlap closure is obtained from the following two overlap closures (OC2).
- a b →⁺ b c a a
- a b →⁺ b c a a
a b →⁺ ε: This is an original rule (OC1).
a b b →⁺ b c c a a: The overlap closure is obtained from the following two overlap closures (OC3).
- a b b →⁺ b c a b c a a
- a b →⁺ ε
a →⁺ ε: This is an original rule (OC1).
a b →⁺ b c a: The overlap closure is obtained from the following two overlap closures (OC2).
- a b →⁺ b c a a
- a →⁺ ε
a b b b →⁺ b c c a b c a: The overlap closure is obtained from the following two overlap closures (OC2).
- a b b →⁺ b c c a a
- a b →⁺ b c a
a b b b →⁺ b c c a b c: The overlap closure is obtained from the following two overlap closures (OC2).
- a b b b →⁺ b c c a b c a
- a →⁺ ε
c c →⁺ b: This is an original rule (OC1).
a b b b →⁺ b b a b c: The overlap closure is obtained from the following two overlap closures (OC3).
- a b b b →⁺ b c c a b c
- c c →⁺ b
a b b b →⁺ b b b c a c: The overlap closure is obtained from the following two overlap closures (OC3).
- a b b b →⁺ b b a b c
- a b →⁺ b c a
a b b b b →⁺ b c a b b b c a c: The overlap closure is obtained from the following two overlap closures (OC2).
- a b →⁺ b c a a
- a b b b →⁺ b b b c a c
a b b b b →⁺ b c a b b b c c: The overlap closure is obtained from the following two overlap closures (OC3).
- a b b b b →⁺ b c a b b b c a c
- a →⁺ ε
a b b b b →⁺ b c a b b b b: The overlap closure is obtained from the following two overlap closures (OC2).
- a b b b b →⁺ b c a b b b c c
- c c →⁺ b