YES
Termination proof of ../tpdb/TRS/CSR/Ex23_Luc06.trs
Termination of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a)) → c(f(g(f(a))))
The replacement map contains the following entries:f: {1}
a: empty set
c: empty set
g: {1}
↳ CSR
↳ Lucas-Transformation
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a)) → c(f(g(f(a))))
The replacement map contains the following entries:f: {1}
a: empty set
c: empty set
g: {1}
We applied the Lucas [26] to transform the context-sensitive TRS to an usual TRS.
↳ CSR
↳ Lucas-Transformation
↳ QTRS
↳ RRRPoloQTRSProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a)) → c
Q is empty.
The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(a)) → c
Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:
f(f(a)) → c
Used ordering:
Polynomial interpretation [25]:
POL(a) = 0
POL(c) = 2
POL(f(x1)) = 2 + x1
↳ CSR
↳ Lucas-Transformation
↳ QTRS
↳ RRRPoloQTRSProof
↳ QTRS
↳ RisEmptyProof
Q restricted rewrite system:
R is empty.
Q is empty.
The TRS R is empty. Hence, termination is trivially proven.