/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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:

   and(tt) -> X
   plus(N, 0) -> N
   plus(N, s(M)) -> s(plus(N, M))


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

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

(2)
BOUNDS(INF, INF)