Certification Problem

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

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by matchbox @ termCOMP 2023)

1 Loop

The following loop proves nontermination.

t₀	=	c(a(c(a(b(b(c(b(x1))))))))
	→	c(a(c(b(a(c(a(b(c(b(x1))))))))))
	→	c(a(c(b(c(a(b(c(b(x1)))))))))
	→	c(a(c(c(a(b(c(b(x1))))))))
	→	c(a(a(b(c(b(x1))))))
	→	c(a(b(a(c(a(c(b(x1))))))))
	→	c(a(b(a(c(c(b(x1)))))))
	→	c(a(b(a(b(x1)))))
	→	c(b(a(c(a(a(b(x1)))))))
	→	c(a(c(a(a(b(x1))))))
	→	c(a(c(a(b(a(c(a(x1))))))))
	→	c(a(c(a(b(b(c(a(x1))))))))
	→	c(a(c(a(b(b(c(b(x1))))))))
	=	t₁₂

where t₁₂ = t₀σ and σ = {x1/x1}