YES Termination proof of rt2-4.trs

Termination of the given RelTRS could be proven:

0 RelTRS
↳1 RelTRSRRRProof (⇔, 27 ms)
↳2 RelTRS
↳3 RIsEmptyProof (⇔, 0 ms)
↳4 YES

(0) Obligation:

Relative term rewrite system:
The relative TRS consists of the following R rules:

f(g(x)) → x

The relative TRS consists of the following S rules:

a → h(g(f(a)))

(1) RelTRSRRRProof (EQUIVALENT transformation)

We used the following monotonic ordering for rule removal:
Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :

POL(f(x1)) =
/0\
\1/
 +
/12\
\02/
·x1

POL(g(x1)) =
/0\
\2/
 +
/10\
\02/
·x1

POL(a) =
/0\
\0/

POL(h(x1)) =
/0\
\0/
 +
/20\
\00/
·x1
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:

f(g(x)) → x
Rules from S:
none


(2) Obligation:

Relative term rewrite system:
R is empty.
The relative TRS consists of the following S rules:

a → h(g(f(a)))

(3) RIsEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(4) YES