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

WORST_CASE(Omega(n^1),?)