Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z042)

The rewrite relation of the following TRS is considered.

c(b(a(b(a(x1)))))

→

a(b(a(b(a(b(c(b(c(x1)))))))))

(1)

Prove or disprove termination.

No.

The following loop proves nontermination.

t₀	=	c(b(a(b(a(b(a(b(a(b(a(b(a(x144)))))))))))))
	→	a(b(a(b(a(b(c(b(c(b(a(b(a(b(a(b(a(x144)))))))))))))))))
	→	a(b(a(b(a(b(c(b(a(b(a(b(a(b(c(b(c(b(a(b(a(x144)))))))))))))))))))))
	→	a(b(a(b(a(b(c(b(a(b(a(b(a(b(c(b(a(b(a(b(a(b(c(b(c(x144)))))))))))))))))))))))))
	→	a(b(a(b(a(b(c(b(a(b(a(b(a(b(a(b(a(b(a(b(c(b(c(b(a(b(c(b(c(x144)))))))))))))))))))))))))))))
	=	t₄

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