/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


Outermost Termination of the given OTRS could be disproven:

(0) OTRS
(1) OutermostNonTerminationProof [COMPLETE, 0 ms]
(2) NO


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

(0)
Obligation:
Term rewrite system R:
The TRS R consists of the following rules:

   f(n__a, X, X) -> f(activate(X), b, n__b)
   b -> a
   a -> n__a
   b -> n__b
   activate(n__a) -> a
   activate(n__b) -> b
   activate(X) -> X



Outermost Strategy.

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

(1) OutermostNonTerminationProof (COMPLETE)
Term rewrite system R:
The TRS R consists of the following rules:

   f(n__a, X, X) -> f(activate(X), b, n__b)
   b -> a
   a -> n__a
   b -> n__b
   activate(n__a) -> a
   activate(n__b) -> b
   activate(X) -> X



Outermost Strategy.

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

f(n__a, n__b, n__b) -> f(activate(n__b), b, n__b) with rule f(n__a, X, X) -> f(activate(X), b, n__b) at position [] and matcher [X / n__b]

f(activate(n__b), b, n__b) -> f(b, b, n__b) with rule activate(n__b) -> b at position [0] and matcher [ ]

f(b, b, n__b) -> f(a, b, n__b) with rule b -> a at position [0] and matcher [ ]

f(a, b, n__b) -> f(n__a, b, n__b) with rule a -> n__a at position [0] and matcher [ ]

f(n__a, b, n__b) -> f(n__a, n__b, n__b) with rule b -> n__b at position [1] and matcher [ ]

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

Context: []

We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop.
----------------------------------------

(2)
NO