/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


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(s(N), cons(X)) -> sel(N, XS)
   fib(N) -> sel(N, fib1(s(0), s(0)))
   fib1(X, Y) -> cons(X)
   add(0, X) -> X
   add(s(X), Y) -> s(add(X, Y))
   sel(0, cons(X)) -> X


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

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

(2)
NO