YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given RelTRS could be proven:

(0) RelTRS
(1) RelTRSRRRProof [EQUIVALENT, 12 ms]
(2) RelTRS
(3) RIsEmptyProof [EQUIVALENT, 0 ms]
(4) YES


----------------------------------------

(0)
Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:

   f(x) -> x

The relative TRS consists of the following S rules:

   a -> g(a)


----------------------------------------

(1) RelTRSRRRProof (EQUIVALENT)
We used the following monotonic ordering for rule removal:
Polynomial interpretation [POLO]:

   POL(a) = 0
   POL(f(x_1)) = 1 + x_1
   POL(g(x_1)) = x_1
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:

   f(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 -> g(a)


----------------------------------------

(3) RIsEmptyProof (EQUIVALENT)
The TRS R is empty. Hence, termination is trivially proven.
----------------------------------------

(4)
YES