/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 (full) of the given CpxTRS could be proven to be BOUNDS(INF, INF).

(0) CpxTRS
(1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(2) TRS for Loop Detection
(3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
(4) BEST
    (5) proven lower bound
        (6) LowerBoundPropagationProof [FINISHED, 0 ms]
        (7) BOUNDS(n^1, INF)
    (8) TRS for Loop Detection
        (9) InfiniteLowerBoundProof [FINISHED, 1335 ms]
        (10) BOUNDS(INF, INF)


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

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


The TRS R consists of the following rules:

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
   nats -> adx(zeros)
   zeros -> cons(0, n__zeros)
   head(cons(X, L)) -> X
   tail(cons(X, L)) -> activate(L)
   incr(X) -> n__incr(X)
   adx(X) -> n__adx(X)
   zeros -> n__zeros
   activate(n__incr(X)) -> incr(activate(X))
   activate(n__adx(X)) -> adx(activate(X))
   activate(n__zeros) -> zeros
   activate(X) -> X

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

(1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID))
Transformed a relative TRS into a decreasing-loop problem.
----------------------------------------

(2)
Obligation:
Analyzing the following TRS for decreasing loops:

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


The TRS R consists of the following rules:

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
   nats -> adx(zeros)
   zeros -> cons(0, n__zeros)
   head(cons(X, L)) -> X
   tail(cons(X, L)) -> activate(L)
   incr(X) -> n__incr(X)
   adx(X) -> n__adx(X)
   zeros -> n__zeros
   activate(n__incr(X)) -> incr(activate(X))
   activate(n__adx(X)) -> adx(activate(X))
   activate(n__zeros) -> zeros
   activate(X) -> X

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

(3) DecreasingLoopProof (LOWER BOUND(ID))
The following loop(s) give(s) rise to the lower bound Omega(n^1):

The rewrite sequence

activate(n__adx(X)) ->^+ adx(activate(X))

gives rise to a decreasing loop by considering the right hand sides subterm at position [0].

The pumping substitution is [X / n__adx(X)].

The result substitution is [ ].




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

(4)
Complex Obligation (BEST)

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

(5)
Obligation:
Proved the lower bound n^1 for the following obligation:

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


The TRS R consists of the following rules:

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
   nats -> adx(zeros)
   zeros -> cons(0, n__zeros)
   head(cons(X, L)) -> X
   tail(cons(X, L)) -> activate(L)
   incr(X) -> n__incr(X)
   adx(X) -> n__adx(X)
   zeros -> n__zeros
   activate(n__incr(X)) -> incr(activate(X))
   activate(n__adx(X)) -> adx(activate(X))
   activate(n__zeros) -> zeros
   activate(X) -> X

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

(6) LowerBoundPropagationProof (FINISHED)
Propagated lower bound.
----------------------------------------

(7)
BOUNDS(n^1, INF)

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

(8)
Obligation:
Analyzing the following TRS for decreasing loops:

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


The TRS R consists of the following rules:

   incr(nil) -> nil
   incr(cons(X, L)) -> cons(s(X), n__incr(activate(L)))
   adx(nil) -> nil
   adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L))))
   nats -> adx(zeros)
   zeros -> cons(0, n__zeros)
   head(cons(X, L)) -> X
   tail(cons(X, L)) -> activate(L)
   incr(X) -> n__incr(X)
   adx(X) -> n__adx(X)
   zeros -> n__zeros
   activate(n__incr(X)) -> incr(activate(X))
   activate(n__adx(X)) -> adx(activate(X))
   activate(n__zeros) -> zeros
   activate(X) -> X

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

(9) InfiniteLowerBoundProof (FINISHED)
The following loop proves infinite runtime complexity:

The rewrite sequence

activate(n__adx(cons(X1_0, n__zeros))) ->^+ cons(s(X1_0), n__incr(activate(n__adx(cons(0, n__zeros)))))

gives rise to a decreasing loop by considering the right hand sides subterm at position [1,0].

The pumping substitution is [ ].

The result substitution is [X1_0 / 0].




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

(10)
BOUNDS(INF, INF)