/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:

   splitAt(s(N), cons(X)) -> u(splitAt(N, XS))
   u(pair(YS, ZS)) -> pair(cons(X), ZS)
   tail(cons(N)) -> XS
   natsFrom(N) -> cons(N)
   fst(pair(XS, YS)) -> XS
   snd(pair(XS, YS)) -> YS
   splitAt(0, XS) -> pair(nil, XS)
   head(cons(N)) -> N
   sel(N, XS) -> head(afterNth(N, XS))
   take(N, XS) -> fst(splitAt(N, XS))
   afterNth(N, XS) -> snd(splitAt(N, XS))


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

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

(2)
NO