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


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


MAYBE
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).

(0) CpxIntTrs
(1) Loat Proof [FINISHED, 134 ms]
(2) BOUNDS(1, INF)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f0(A, B, C) -> Com_1(f1(A, B, C)) :|: TRUE
f1(A, B, C) -> Com_1(f1(A + B, B - C, C + 1)) :|: A >= 1

The start-symbols are:[f0_3]


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

(1) Loat Proof (FINISHED)


### Pre-processing the ITS problem ###



Initial linear ITS problem

   Start location: f0

      0: f0 -> f1 : [], cost: 1

      1: f1 -> f1 : A'=A+B, B'=-C+B, C'=1+C, [ A>=1 ], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 1.

   Accelerating the following rules:

      1: f1 -> f1 : A'=A+B, B'=-C+B, C'=1+C, [ A>=1 ], cost: 1



   Found no metering function for rule 1.

   Removing the simple loops:.



Accelerated all simple loops using metering functions (where possible):

   Start location: f0

      0: f0 -> f1 : [], cost: 1

      1: f1 -> f1 : A'=A+B, B'=-C+B, C'=1+C, [ A>=1 ], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f0

      0: f0 -> f1 : [], cost: 1

      2: f0 -> f1 : A'=A+B, B'=-C+B, C'=1+C, [ A>=1 ], cost: 2



Removed unreachable locations (and leaf rules with constant cost):

   Start location: f0



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: f0



Obtained the following overall complexity (w.r.t. the length of the input n):

   Complexity:  Unknown

   Cpx degree:  ?

   Solved cost: 0

   Rule cost:   0

   Rule guard:  []



WORST_CASE(Omega(0),?)


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

(2)
BOUNDS(1, INF)