/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, 0 ms]
(2) NO


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

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

   f(s(x)) -> f(x)

The relative TRS consists of the following S rules:

   inf -> s(inf)


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

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

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

f(inf) -> f(s(inf)) with rule inf -> s(inf) at position [0] and matcher [ ]

f(s(inf)) -> f(inf) with rule f(s(x)) -> f(x) at position [] and matcher [x / inf]

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

Context: []

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

(2)
NO