/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 GTRS could be disproven:

(0) GTRS
(1) CritRuleProof [COMPLETE, 0 ms]
(2) NO


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

(0)
Obligation:
Generalized rewrite system (where rules with free variables on rhs are allowed):
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)


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

(1) CritRuleProof (COMPLETE)
The rule sel(0, cons) -> X contains free variables in its right-hand side. Hence the TRS is not-terminating.
----------------------------------------

(2)
NO