Certification Problem

Input (TPDB TRS_Innermost/Mixed_innermost/n001)

The rewrite relation of the following TRS is considered.

h(f(f(x)))	→	h(f(g(f(x))))	(1)
f(g(f(x)))	→	f(f(x))	(2)

The evaluation strategy is innermost.

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by AProVE @ termCOMP 2023)

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

h^#(f(f(x)))	→	h^#(f(g(f(x))))	(3)
h^#(f(f(x)))	→	f^#(g(f(x)))	(4)
f^#(g(f(x)))	→	f^#(f(x))	(5)

It remains to prove infiniteness of the resulting DP problem.

1.1 Pair and Rule Removal

Some pairs and rules have been removed and it remains to prove infiniteness of the remaing problem. The following pairs have been deleted.

h^#(f(f(x)))	→	f^#(g(f(x)))	(4)
f^#(g(f(x)))	→	f^#(f(x))	(5)

and the following rules have been deleted.

1.1.1 Pair and Rule Removal

Some pairs and rules have been removed and it remains to prove infiniteness of the remaing problem. The following pairs have been deleted. and the following rules have been deleted.

h(f(f(x)))

→

h(f(g(f(x))))

(1)

1.1.1.1 Innermost Lhss Removal Processor

We restrict the innermost strategy to the following left hand sides.

f(g(f(x0)))

1.1.1.1.1 Loop

The following loop proves infiniteness of the DP problem.

t₀	=	h^#(f(g(f(x'))))
	→_R	h^#(f(f(x')))
	→_P	h^#(f(g(f(x'))))
	=	t₂

where t₂ = t₀σ and σ = {x'/x'}