YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

a(b(x0)) → b(a(x0))

Proof

1 Rule Removal

Using the Knuth Bendix order with w0 = 1 and the following precedence and weight function
prec(a) = 1 weight(a) = 1
prec(b) = 0 weight(b) = 1
all rules could be removed.

1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.