(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f → f
Q is empty.
(1) QTRS Reverse (EQUIVALENT transformation)
We applied the QTRS Reverse Processor [REVERSE].
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f'(x) → f'(x)
Q is empty.
(3) NonTerminationProof (EQUIVALENT transformation)
We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.
Found the self-embedding DerivationStructure:
f' → f'
f' →
f'by original rule (OC 1)
(4) NO