Certification Problem

Input (TPDB TRS_Standard/Strategy_removed_CSR_05/Ex6_GM04)

The rewrite relation of the following TRS is considered.

c → f(g(c)) (1)
f(g(X)) → g(X) (2)

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by ttt2 @ termCOMP 2023)

1 Loop

The following loop proves nontermination.

t0 = c
→ f(g(c))
= t1
where t1 = C[t0] and C = f(g(☐))