KILLED
proof of /export/starexec/sandbox2/benchmark/theBenchmark.trs
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, INF).

(0) CpxRelTRS


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

(0)
Obligation:
The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(1, INF).


The TRS R consists of the following rules:

   A__FROM(z0) -> c(MARK(z0))
   A__FROM(z0) -> c1
   A__FIRST(0, z0) -> c2
   A__FIRST(s(z0), cons(z1, z2)) -> c3(MARK(z1))
   A__FIRST(z0, z1) -> c4
   A__SEL(0, cons(z0, z1)) -> c5(MARK(z0))
   A__SEL(s(z0), cons(z1, z2)) -> c6(A__SEL(mark(z0), mark(z2)), MARK(z0))
   A__SEL(s(z0), cons(z1, z2)) -> c7(A__SEL(mark(z0), mark(z2)), MARK(z2))
   A__SEL(z0, z1) -> c8
   MARK(from(z0)) -> c9(A__FROM(mark(z0)), MARK(z0))
   MARK(first(z0, z1)) -> c10(A__FIRST(mark(z0), mark(z1)), MARK(z0))
   MARK(first(z0, z1)) -> c11(A__FIRST(mark(z0), mark(z1)), MARK(z1))
   MARK(sel(z0, z1)) -> c12(A__SEL(mark(z0), mark(z1)), MARK(z0))
   MARK(sel(z0, z1)) -> c13(A__SEL(mark(z0), mark(z1)), MARK(z1))
   MARK(cons(z0, z1)) -> c14(MARK(z0))
   MARK(s(z0)) -> c15(MARK(z0))
   MARK(0) -> c16
   MARK(nil) -> c17

The (relative) TRS S consists of the following rules:

   a__from(z0) -> cons(mark(z0), from(s(z0)))
   a__from(z0) -> from(z0)
   a__first(0, z0) -> nil
   a__first(s(z0), cons(z1, z2)) -> cons(mark(z1), first(z0, z2))
   a__first(z0, z1) -> first(z0, z1)
   a__sel(0, cons(z0, z1)) -> mark(z0)
   a__sel(s(z0), cons(z1, z2)) -> a__sel(mark(z0), mark(z2))
   a__sel(z0, z1) -> sel(z0, z1)
   mark(from(z0)) -> a__from(mark(z0))
   mark(first(z0, z1)) -> a__first(mark(z0), mark(z1))
   mark(sel(z0, z1)) -> a__sel(mark(z0), mark(z1))
   mark(cons(z0, z1)) -> cons(mark(z0), z1)
   mark(s(z0)) -> s(mark(z0))
   mark(0) -> 0
   mark(nil) -> nil

Rewrite Strategy: INNERMOST