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


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

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

   p(0, y) -> y
   p(s(x), y) -> s(p(x, y))

The relative TRS consists of the following S rules:

   p(x, y) -> s(p(x, y))


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

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

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

p(p(x', y'), y) -> p(s(p(x', y')), y) with rule p(x'', y'') -> s(p(x'', y'')) at position [0] and matcher [x'' / x', y'' / y']

p(s(p(x', y')), y) -> s(p(p(x', y'), y)) with rule p(s(x), y'') -> s(p(x, y'')) at position [] and matcher [x / p(x', y'), y'' / y]

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

Context: s([])

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

(2)
NO