/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


WORST_CASE(Omega(n^1),O(n^1))
* Step 1: Sum.  WORST_CASE(Omega(n^1),O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(g(x)) -> g(g(f(x)))
            f(g(x)) -> g(g(g(x)))
        - Signature:
            {f/1} / {g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: Sum.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            f(g(x)) -> g(g(f(x)))
            f(g(x)) -> g(g(g(x)))
        - Signature:
            {f/1} / {g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:2: DecreasingLoops.  WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            f(g(x)) -> g(g(f(x)))
            f(g(x)) -> g(g(g(x)))
        - Signature:
            {f/1} / {g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          f(x){x -> g(x)} =
            f(g(x)) ->^+ g(g(f(x)))
              = C[f(x) = f(x){}]

** Step 1.b:1: ToInnermost.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(g(x)) -> g(g(f(x)))
            f(g(x)) -> g(g(g(x)))
        - Signature:
            {f/1} / {g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        ToInnermost
    + Details:
        switch to innermost, as the system is overlay and right linear and does not contain weak rules
** Step 1.b:2: Bounds.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(g(x)) -> g(g(f(x)))
            f(g(x)) -> g(g(g(x)))
        - Signature:
            {f/1} / {g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          f_0(2) -> 1
          f_1(2) -> 4
          g_0(2) -> 2
          g_1(2) -> 4
          g_1(3) -> 1
          g_1(3) -> 4
          g_1(4) -> 3
** Step 1.b:3: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(g(x)) -> g(g(f(x)))
            f(g(x)) -> g(g(g(x)))
        - Signature:
            {f/1} / {g/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(Omega(n^1),O(n^1))