Certification Problem

Input (TPDB TRS_Standard/Transformed_CSR_04/LengthOfFiniteLists_nosorts_FR)

The rewrite relation of the following TRS is considered.

zeros	→	cons(0,n__zeros)	(1)
and(tt,X)	→	activate(X)	(2)
length(nil)	→	0	(3)
length(cons(N,L))	→	s(length(activate(L)))	(4)
zeros	→	n__zeros	(5)
activate(n__zeros)	→	zeros	(6)
activate(X)	→	X	(7)

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by ttt2 @ termCOMP 2023)

1 Loop

The following loop proves nontermination.

t₀	=	length(cons(N,n__zeros))
	→	s(length(activate(n__zeros)))
	→	s(length(zeros))
	→	s(length(cons(0,n__zeros)))
	=	t₃

where t₃ = C[t₀σ] and σ = {N/0} and C = s(☐)