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


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


WORST_CASE(NON_POLY, ?)
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

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


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f1(A, B, C, D, E, F, G, H) -> Com_1(f1(A, B, I, J, K, F, G, H)) :|: B >= 1 + A
f1(A, B, C, D, E, F, G, H) -> Com_1(f300(A, B, I, J, E, K, G, H)) :|: A >= B
f2(A, B, C, D, E, F, G, H) -> Com_1(f1(A, B, C, D, E, F, I, J)) :|: TRUE

The start-symbols are:[f2_8]


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

(1) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: f2

      0: f1 -> f1 : C'=free_2, D'=free, E'=free_1, [ A>=1+B ], cost: 1

      1: f1 -> f300 : C'=free_5, D'=free_3, F'=free_4, [ B>=A ], cost: 1

      2: f2 -> f1 : G'=free_7, H'=free_6, [], cost: 1



Checking for constant complexity:

   The following rule is satisfiable with cost >= 1, yielding constant complexity:

      2: f2 -> f1 : G'=free_7, H'=free_6, [], cost: 1



Removed unreachable and leaf rules:

   Start location: f2

      0: f1 -> f1 : C'=free_2, D'=free, E'=free_1, [ A>=1+B ], cost: 1

      2: f2 -> f1 : G'=free_7, H'=free_6, [], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 0.

   Accelerating the following rules:

      0: f1 -> f1 : C'=free_2, D'=free, E'=free_1, [ A>=1+B ], cost: 1



   Accelerated rule 0 with NONTERM, yielding the new rule 3.

   Removing the simple loops: 0.



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

   Start location: f2

      3: f1 -> [3] : [ A>=1+B ], cost: NONTERM

      2: f2 -> f1 : G'=free_7, H'=free_6, [], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f2

      2: f2 -> f1 : G'=free_7, H'=free_6, [], cost: 1

      4: f2 -> [3] : G'=free_7, H'=free_6, [ A>=1+B ], cost: NONTERM



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

   Start location: f2

      4: f2 -> [3] : G'=free_7, H'=free_6, [ A>=1+B ], cost: NONTERM



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: f2

      4: f2 -> [3] : G'=free_7, H'=free_6, [ A>=1+B ], cost: NONTERM



Computing asymptotic complexity for rule 4

   Guard is satisfiable, yielding nontermination

   Resulting cost NONTERM has complexity: Nonterm



Found new complexity Nonterm.



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

   Complexity:  Nonterm

   Cpx degree:  Nonterm

   Solved cost: NONTERM

   Rule cost:   NONTERM

   Rule guard:  [ A>=1+B ]



NO


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

(2)
BOUNDS(INF, INF)