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(x1)) → b(b(b(x1)))
b(b(b(b(b(x1))))) → a(a(a(x1)))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
a(a(x1)) → b(b(b(x1)))
b(b(b(b(b(x1))))) → a(a(a(x1)))
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:trivial
and weight map:
a_1=13
dummyConstant=1
b_1=8