Certification Problem

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

The rewrite relation of the following TRS is considered.

a(x1)	→	x1	(1)
a(b(x1))	→	b(a(c(b(c(x1)))))	(2)
b(x1)	→	a(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(x33527))))
	→	b(a(c(b(c(c(b(x33527)))))))
	→	a(a(c(b(c(c(b(x33527)))))))
	→	a(a(c(a(c(c(b(x33527)))))))
	→	a(a(c(a(b(x33527)))))
	→	a(a(c(b(a(c(b(c(x33527))))))))
	→	a(a(c(a(a(c(b(c(x33527))))))))
	→	a(a(c(a(c(b(c(x33527)))))))
	→	a(a(c(c(b(c(x33527))))))
	→	a(a(b(c(x33527))))
	→	a(b(a(c(b(c(c(x33527)))))))
	→	a(b(c(b(c(c(x33527))))))
	=	t₁₁

where t₁₁ = t₀σ and σ = {x33527/c(c(x33527))}