/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


NO
proof of /export/starexec/sandbox/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:

   sel(0, cons) -> X
   sel(s, cons) -> sel(X, Z)
   dbl1(s) -> s1(s1(dbl1(X)))
   sel1(0, cons) -> X
   sel1(s, cons) -> sel1(X, Z)
   quote(s) -> s1(quote(X))
   dbl(0) -> 0
   dbl(s) -> s
   dbls(nil) -> nil
   dbls(cons) -> cons
   indx(nil) -> nil
   indx(cons) -> cons
   from -> cons
   dbl1(0) -> 01
   quote(0) -> 01
   quote(dbl(X)) -> dbl1(X)
   quote(sel(X, Y)) -> sel1(X, Y)



Outermost Strategy.

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

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

   sel(0, cons) -> X
   sel(s, cons) -> sel(X, Z)
   dbl1(s) -> s1(s1(dbl1(X)))
   sel1(0, cons) -> X
   sel1(s, cons) -> sel1(X, Z)
   quote(s) -> s1(quote(X))
   dbl(0) -> 0
   dbl(s) -> s
   dbls(nil) -> nil
   dbls(cons) -> cons
   indx(nil) -> nil
   indx(cons) -> cons
   from -> cons
   dbl1(0) -> 01
   quote(0) -> 01
   quote(dbl(X)) -> dbl1(X)
   quote(sel(X, Y)) -> sel1(X, Y)



Outermost Strategy.

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

sel(0, cons) -> sel(0, cons) with rule sel(0, cons) -> X at position [] and matcher [X / sel(0, cons)]

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