(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a__f(f(a)) → c(f(g(f(a))))
mark(f(X)) → a__f(mark(X))
mark(a) → a
mark(c(X)) → c(X)
mark(g(X)) → g(mark(X))
a__f(X) → f(X)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
mark1 > [af1, a] > [f1, g1] > c1
Status:
f1: [1]
a: []
c1: [1]
af1: [1]
g1: [1]
mark1: [1]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
a__f(f(a)) → c(f(g(f(a))))
mark(f(X)) → a__f(mark(X))
mark(a) → a
mark(c(X)) → c(X)
mark(g(X)) → g(mark(X))
a__f(X) → f(X)
(2) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(3) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(4) TRUE