(0) Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:
f(x) → s(x)
f(s(s(x))) → s(f(f(x)))
The relative TRS consists of the following S rules:
rand(x) → rand(s(x))
rand(x) → x
(1) RelTRSRRRProof (EQUIVALENT transformation)
We used the following monotonic ordering for rule removal:
Polynomial interpretation [POLO]:
POL(f(x1)) = x1
POL(rand(x1)) = 1 + x1
POL(s(x1)) = x1
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:
none
Rules from S:
rand(x) → x
(2) Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:
f(x) → s(x)
f(s(s(x))) → s(f(f(x)))
The relative TRS consists of the following S rules:
rand(x) → rand(s(x))
(3) RelTRSRRRProof (EQUIVALENT transformation)
We used the following monotonic ordering for rule removal:
Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:
f(s(s(x))) → s(f(f(x)))
Rules from S:
none
(4) Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:
f(x) → s(x)
The relative TRS consists of the following S rules:
rand(x) → rand(s(x))
(5) RelTRSRRRProof (EQUIVALENT transformation)
We used the following monotonic ordering for rule removal:
Polynomial interpretation [POLO]:
POL(f(x1)) = 1 + x1
POL(rand(x1)) = x1
POL(s(x1)) = x1
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:
f(x) → s(x)
Rules from S:
none
(6) Obligation:
Relative term rewrite system:
R is empty.
The relative TRS consists of the following S rules:
rand(x) → rand(s(x))
(7) RIsEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(8) YES