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


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


WORST_CASE(?,O(1))
* Step 1: Sum.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2} / {h/1,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {h,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: ToInnermost.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2} / {h/1,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {h,s}
    + Applied Processor:
        ToInnermost
    + Details:
        switch to innermost, as the system is overlay and right linear and does not contain weak rules
* Step 3: DependencyPairs.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2} / {h/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {h,s}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          f#(s(X),Y) -> c_1(f#(h(Y),X))
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 4: UsableRules.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            f#(s(X),Y) -> c_1(f#(h(Y),X))
        - Weak TRS:
            f(s(X),Y) -> h(s(f(h(Y),X)))
        - Signature:
            {f/2,f#/2} / {h/1,s/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s}
    + Applied Processor:
        UsableRules
    + Details:
        We replace rewrite rules by usable rules:
          f#(s(X),Y) -> c_1(f#(h(Y),X))
* Step 5: Trivial.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            f#(s(X),Y) -> c_1(f#(h(Y),X))
        - Signature:
            {f/2,f#/2} / {h/1,s/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s}
    + Applied Processor:
        Trivial
    + Details:
        Consider the dependency graph
          1:S:f#(s(X),Y) -> c_1(f#(h(Y),X))
             
          
        The dependency graph contains no loops, we remove all dependency pairs.
* Step 6: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        
        - Signature:
            {f/2,f#/2} / {h/1,s/1,c_1/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(1))