YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

0(1(2(3(4(5(1(x0))))))) 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(x0)))))))))))))))))))
0(1(2(3(4(5(1(x0))))))) 1(2(3(4(5(1(1(0(1(2(3(4(5(0(1(2(3(4(5(0(1(2(3(4(5(x0)))))))))))))))))))))))))

Proof

1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS
1(5(4(3(2(1(0(x0))))))) 5(4(3(2(1(0(5(4(3(2(1(0(1(1(5(4(3(2(1(x0)))))))))))))))))))
1(5(4(3(2(1(0(x0))))))) 5(4(3(2(1(0(5(4(3(2(1(0(5(4(3(2(1(0(1(1(5(4(3(2(1(x0)))))))))))))))))))))))))

1.1 Bounds

The given TRS is match-bounded by 2. This is shown by the following automaton.