YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

v(s(x0)) s(p(p(s(s(s(s(s(s(s(s(w(p(p(s(s(p(s(p(s(x0))))))))))))))))))))
v(0(x0)) p(p(s(s(0(p(p(s(s(s(s(s(x0))))))))))))
w(s(x0)) s(s(s(s(s(s(p(p(s(s(v(p(p(s(s(s(p(p(s(s(x0))))))))))))))))))))
w(0(x0)) p(s(p(p(p(p(p(p(p(p(s(s(0(s(s(s(s(s(s(x0)))))))))))))))))))
p(p(s(x0))) p(x0)
p(s(x0)) x0
p(0(x0)) 0(s(s(s(s(s(s(s(p(s(x0))))))))))

Proof

1 Bounds

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