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


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


WORST_CASE(NON_POLY, ?)
proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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

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


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f2(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f2(A, C, C, L, M, N, G, H, I, J, K)) :|: A >= 1
f300(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f1(A, L, N, P, Q, F, G, L, M, O, R)) :|: 0 >= G
f300(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f2(A, N, N, P, Q, R, G, L, M, O, K)) :|: A >= 1 && G >= 1
f300(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f1(A, N, N, P, Q, R, G, L, M, O, S)) :|: 0 >= A && G >= 1

The start-symbols are:[f300_11]


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

(1) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: f300

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

      1: f300 -> f1 : B'=free_3, C'=free_5, D'=free_7, E'=free_9, H'=free_3, Q'=free_4, J'=free_6, K'=free_8, [ 0>=G ], cost: 1

      2: f300 -> f2 : B'=free_10, C'=free_10, D'=free_12, E'=free_14, F'=free_16, H'=free_11, Q'=free_13, J'=free_15, [ A>=1 && G>=1 ], cost: 1

      3: f300 -> f1 : B'=free_17, C'=free_17, D'=free_20, E'=free_22, F'=free_24, H'=free_19, Q'=free_21, J'=free_23, K'=free_18, [ 0>=A && G>=1 ], cost: 1



Removed unreachable and leaf rules:

   Start location: f300

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

      2: f300 -> f2 : B'=free_10, C'=free_10, D'=free_12, E'=free_14, F'=free_16, H'=free_11, Q'=free_13, J'=free_15, [ A>=1 && G>=1 ], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 0.

   Accelerating the following rules:

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



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

   Removing the simple loops: 0.



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

   Start location: f300

      4: f2 -> [3] : [ A>=1 ], cost: INF

      2: f300 -> f2 : B'=free_10, C'=free_10, D'=free_12, E'=free_14, F'=free_16, H'=free_11, Q'=free_13, J'=free_15, [ A>=1 && G>=1 ], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f300

      2: f300 -> f2 : B'=free_10, C'=free_10, D'=free_12, E'=free_14, F'=free_16, H'=free_11, Q'=free_13, J'=free_15, [ A>=1 && G>=1 ], cost: 1

      5: f300 -> [3] : B'=free_10, C'=free_10, D'=free_12, E'=free_14, F'=free_16, H'=free_11, Q'=free_13, J'=free_15, [ A>=1 && G>=1 ], cost: INF



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

   Start location: f300

      5: f300 -> [3] : B'=free_10, C'=free_10, D'=free_12, E'=free_14, F'=free_16, H'=free_11, Q'=free_13, J'=free_15, [ A>=1 && G>=1 ], cost: INF



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: f300

      5: f300 -> [3] : B'=free_10, C'=free_10, D'=free_12, E'=free_14, F'=free_16, H'=free_11, Q'=free_13, J'=free_15, [ A>=1 && G>=1 ], cost: INF



Computing asymptotic complexity for rule 5

   Resulting cost INF 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: INF

   Rule cost:   INF

   Rule guard:  [ A>=1 && G>=1 ]



NO


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

(2)
BOUNDS(INF, INF)