Termination w.r.t. Q
of the given
QTRS
could be
proven
:
0 QTRS
↳
1 DirectTerminationProof (⇔)
↳
2 TRUE
(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a
(
b
(
a
(
x
))) →
b
(
a
(
x
))
Q is empty.
(1) DirectTerminationProof (EQUIVALENT transformation)
We use [DIRECT_TERMINATION] with the following order to prove termination.
Knuth-Bendix order [KBO] with precedence:
a
1
> b
1
and weight map:
a_1=1
b_1=1
The variable weight is 1
(2)
TRUE