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


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


WORST_CASE(?,O(n^1))
* Step 1: Sum WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(g(x),y,y) -> g(f(x,x,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: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(g(x),y,y) -> g(f(x,x,y))
        - Signature:
            {f/3} / {g/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {g}
    + Applied Processor:
        NaturalPI {shape = Linear, restrict = Restrict, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(linear):
        The following argument positions are considered usable:
          uargs(g) = {1}
        
        Following symbols are considered usable:
          all
        TcT has computed the following interpretation:
          p(f) = 6*x1  
          p(g) = 3 + x1
        
        Following rules are strictly oriented:
        f(g(x),y,y) = 18 + 6*x   
                    > 3 + 6*x    
                    = g(f(x,x,y))
        
        
        Following rules are (at-least) weakly oriented:
        
* Step 3: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(g(x),y,y) -> g(f(x,x,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))