Certification Problem

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

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by ttt2 @ termCOMP 2023)

1 Loop

The following loop proves nontermination.

t₀	=	a(b(c(b(b(x51367)))))
	→	b(b(a(a(c(a(c(b(b(x51367)))))))))
	→	b(b(a(a(c(c(b(b(x51367))))))))
	→	b(b(a(a(b(b(x51367))))))
	→	b(b(a(b(b(a(a(c(a(b(x51367))))))))))
	→	b(b(b(b(a(a(c(a(b(a(a(c(a(b(x51367))))))))))))))
	→	b(b(b(b(a(a(c(a(b(a(c(a(b(x51367)))))))))))))
	→	b(b(b(b(a(a(c(a(b(c(a(b(x51367))))))))))))
	→	b(b(b(b(a(a(c(a(b(c(b(b(a(a(c(a(x51367))))))))))))))))
	=	t₈

where t₈ = C[t₀σ] and σ = {x51367/a(a(c(a(x51367))))} and C = b(b(b(b(a(a(c(☐)))))))