/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(x, y, f(z, u, v)) -> f(f(x, y, z), u, f(x, y, v))



Outermost Strategy.

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

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

   f(x, y, f(z, u, v)) -> f(f(x, y, z), u, f(x, y, v))



Outermost Strategy.

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

f(x, y, f(z, u, v)) -> f(f(x, y, z), u, f(x, y, v)) with rule f(x', y', f(z', u', v')) -> f(f(x', y', z'), u', f(x', y', v')) at position [] and matcher [x' / x, y' / y, z' / z, u' / u, v' / v]

Now an instance of the first term with Matcher [x / f(x, y, z), y / u, z / x, u / y] 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