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))))))) 0(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)))))))))))))))))))))))))
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(0(1(2(3(4(5(x0)))))))))))))))))))))))))))))))

Proof

1 Bounds

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