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


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


WORST_CASE(?,O(n^1))
* Step 1: Sum.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(x,x,y) -> x
            f(x,y,y) -> y
            f(x,y,g(y)) -> x
            f(f(x,y,z),u,f(x,y,v)) -> f(x,y,f(z,u,v))
            f(g(x),x,y) -> y
        - Signature:
            {f/3} / {g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: Bounds.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(x,x,y) -> x
            f(x,y,y) -> y
            f(x,y,g(y)) -> x
            f(f(x,y,z),u,f(x,y,v)) -> f(x,y,f(z,u,v))
            f(g(x),x,y) -> y
        - Signature:
            {f/3} / {g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 0.
        The enriched problem is compatible with follwoing automaton.
          f_0(2,2,2) -> 1
          g_0(2) -> 1
          g_0(2) -> 2
          2 -> 1
* Step 3: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(x,x,y) -> x
            f(x,y,y) -> y
            f(x,y,g(y)) -> x
            f(f(x,y,z),u,f(x,y,v)) -> f(x,y,f(z,u,v))
            f(g(x),x,y) -> y
        - Signature:
            {f/3} / {g/1}
        - Obligation:
             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(?,O(n^1))