/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given RelTRS could be disproven:

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


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

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

   f(act, y) -> f(el(nact), y)
   f(x, nact) -> f(x, act)
   act -> el(nact)
   l(el(x)) -> el(l(x))
   el(r(x)) -> r(el(x))

The relative TRS consists of the following S rules:

   nact -> l(nact)
   nact -> r(nact)


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

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

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

el(nact) -> el(r(nact)) with rule nact -> r(nact) at position [0] and matcher [ ]

el(r(nact)) -> r(el(nact)) with rule el(r(x)) -> r(el(x)) at position [] and matcher [x / nact]

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

Context: r([])

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

(2)
NO