Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(a(x1))) → b(b(x1))
b(b(b(x1))) → c(d(x1))
c(x1) → a(a(x1))
d(x1) → c(x1)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(a(x1))) → b(b(x1))
b(b(b(x1))) → c(d(x1))
c(x1) → a(a(x1))
d(x1) → c(x1)
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:trivial
and weight map:
c_1=2871
b_1=2052
d_1=2880
a_1=1413
dummyConstant=1