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


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


WORST_CASE(?, O(1))
proof of /export/starexec/sandbox/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:

   fst(0, Z) -> nil
   fst(s, cons(Y)) -> cons(Y)
   from(X) -> cons(X)
   add(0, X) -> X
   add(s, Y) -> s
   len(nil) -> 0
   len(cons(X)) -> s

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:

len(cons(x0)) ->^* s

len(nil) ->^* 0

add(s, x0) ->^* s

from(x0) ->^* cons(x0)

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

fst(0, x0) ->^* nil




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

(2)
BOUNDS(1, 1)