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


Termination of the given RelTRS could be disproven:

(0) RelTRS
(1) RelTRSLoopFinderProof [COMPLETE, 0 ms]
(2) NO


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

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

   b(a(x)) -> a(b(x))

The relative TRS consists of the following S rules:

   a(x) -> a(a(x))
   b(x) -> b(b(x))


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

(1) RelTRSLoopFinderProof (COMPLETE)
The following loop was found:

---------- Loop: ----------

b(a(x')) -> b(a(a(x'))) with rule a(x'') -> a(a(x'')) at position [0] and matcher [x'' / x']

b(a(a(x'))) -> a(b(a(x'))) with rule b(a(x)) -> a(b(x)) at position [] and matcher [x / a(x')]

Now an instance of the first term with Matcher [ ] occurs in the last term at position [0].

Context: a([])

Therefore, the relative TRS problem does not terminate.
----------------------------------------

(2)
NO