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


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


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


The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, 1).

(0) CpxTRS
(1) NarrowingOnBasicTermsTerminatesProof [FINISHED, 0 ms]
(2) BOUNDS(1, 1)


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

(0)
Obligation:
The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, 1).


The TRS R consists of the following rules:

   terms(N) -> cons(recip(sqr(N)))
   sqr(0) -> 0
   sqr(s) -> s
   dbl(0) -> 0
   dbl(s) -> s
   add(0, X) -> X
   add(s, Y) -> s
   first(0, X) -> nil
   first(s, cons(Y)) -> cons(Y)

S is empty.
Rewrite Strategy: FULL
----------------------------------------

(1) NarrowingOnBasicTermsTerminatesProof (FINISHED)
Constant runtime complexity proven by termination of constructor-based narrowing.

The maximal most general narrowing sequences give rise to the following rewrite sequences:

first(s, cons(x0)) ->^* cons(x0)

first(0, x0) ->^* nil

add(s, x0) ->^* s

dbl(s) ->^* s

dbl(0) ->^* 0

sqr(s) ->^* s

sqr(0) ->^* 0

terms(s) ->^* cons(recip(s))

terms(0) ->^* cons(recip(0))




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

(2)
BOUNDS(1, 1)