Certification Problem

Input (TPDB TRS_Standard/Endrullis_06/quadruple1)

The rewrite relation of the following TRS is considered.

p(p(b(a(x0)),x1),p(x2,x3)) p(p(x3,a(x2)),p(b(a(x1)),b(x0))) (1)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 Bounds

The given TRS is match-(raise)-bounded by 1. This is shown by the following automaton. The automaton is closed under rewriting as it is compatible.