Certification Problem

Input (TPDB TRS_Standard/HirokawaMiddeldorp_04/n008)

The rewrite relation of the following TRS is considered.

f(a)	→	f(a)	(1)
a	→	b	(2)

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by ttt2 @ termCOMP 2023)

1 Loop

The following loop proves nontermination.

t₀	=	f(a)
	→	f(a)
	=	t₁

where t₁ = t₀