YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

i(0(x0)) p(s(p(s(0(p(s(p(s(x0)))))))))
i(s(x0)) p(s(p(s(s(j(p(s(p(s(p(p(p(p(s(s(s(s(x0))))))))))))))))))
j(0(x0)) p(s(p(p(s(s(0(p(s(p(s(x0)))))))))))
j(s(x0)) s(s(s(s(p(p(s(s(i(p(s(p(s(x0)))))))))))))
p(p(s(x0))) p(x0)
p(s(x0)) x0
p(0(x0)) 0(s(s(s(s(s(s(s(s(x0)))))))))

Proof

1 Bounds

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