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


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

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

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

The relative TRS consists of the following S rules:

   gen -> 0
   gen -> s(gen)


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

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

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

-(gen, gen) -> -(gen, s(gen)) with rule gen -> s(gen) at position [1] and matcher [ ]

-(gen, s(gen)) -> -(s(gen), s(gen)) with rule gen -> s(gen) at position [0] and matcher [ ]

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

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