/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


WORST_CASE(NON_POLY, ?)
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).

(0) Name of obligation not specified
(1) ExtraVarProof [FINISHED, 0 ms]
(2) BOUNDS(INF, INF)


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

(0)
Obligation:
The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).


The TRS R consists of the following rules:

   2ndspos(s(N), cons(X)) -> rcons(posrecip(Y), 2ndsneg(N, Z))
   2ndsneg(s(N), cons(X)) -> rcons(negrecip(Y), 2ndspos(N, Z))
   from(X) -> cons(X)
   2ndspos(0, Z) -> rnil
   2ndsneg(0, Z) -> rnil
   pi(X) -> 2ndspos(X, from(0))
   plus(0, Y) -> Y
   plus(s(X), Y) -> s(plus(X, Y))
   times(0, Y) -> 0
   times(s(X), Y) -> plus(Y, times(X, Y))
   square(X) -> times(X, X)


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

(1) ExtraVarProof (FINISHED)
unbounded runtime complexity due to extra variable on rhs
----------------------------------------

(2)
BOUNDS(INF, INF)