/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /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:
            app(cons(X),YS) -> cons(X)
            app(nil(),YS) -> YS
            from(X) -> cons(X)
            prefix(L) -> cons(nil())
            zWadr(XS,nil()) -> nil()
            zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X)))
            zWadr(nil(),YS) -> nil()
        - Signature:
            {app/2,from/1,prefix/1,zWadr/2} / {cons/1,nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {cons,nil}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DependencyPairs.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            app(cons(X),YS) -> cons(X)
            app(nil(),YS) -> YS
            from(X) -> cons(X)
            prefix(L) -> cons(nil())
            zWadr(XS,nil()) -> nil()
            zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X)))
            zWadr(nil(),YS) -> nil()
        - Signature:
            {app/2,from/1,prefix/1,zWadr/2} / {cons/1,nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {cons,nil}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:
        
        Strict DPs
          app#(cons(X),YS) -> c_1()
          app#(nil(),YS) -> c_2()
          from#(X) -> c_3()
          prefix#(L) -> c_4()
          zWadr#(XS,nil()) -> c_5()
          zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X)))
          zWadr#(nil(),YS) -> c_7()
        Weak DPs
          
        
        and mark the set of starting terms.
* Step 3: PredecessorEstimation.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            app#(cons(X),YS) -> c_1()
            app#(nil(),YS) -> c_2()
            from#(X) -> c_3()
            prefix#(L) -> c_4()
            zWadr#(XS,nil()) -> c_5()
            zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X)))
            zWadr#(nil(),YS) -> c_7()
        - Weak TRS:
            app(cons(X),YS) -> cons(X)
            app(nil(),YS) -> YS
            from(X) -> cons(X)
            prefix(L) -> cons(nil())
            zWadr(XS,nil()) -> nil()
            zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X)))
            zWadr(nil(),YS) -> nil()
        - Signature:
            {app/2,from/1,prefix/1,zWadr/2,app#/2,from#/1,prefix#/1,zWadr#/2} / {cons/1,nil/0,c_1/0,c_2/0,c_3/0,c_4/0
            ,c_5/0,c_6/1,c_7/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {app#,from#,prefix#,zWadr#} and constructors {cons,nil}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {1,2,3,4,5,7}
        by application of
          Pre({1,2,3,4,5,7}) = {6}.
        Here rules are labelled as follows:
          1: app#(cons(X),YS) -> c_1()
          2: app#(nil(),YS) -> c_2()
          3: from#(X) -> c_3()
          4: prefix#(L) -> c_4()
          5: zWadr#(XS,nil()) -> c_5()
          6: zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X)))
          7: zWadr#(nil(),YS) -> c_7()
* Step 4: PredecessorEstimation.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict DPs:
            zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X)))
        - Weak DPs:
            app#(cons(X),YS) -> c_1()
            app#(nil(),YS) -> c_2()
            from#(X) -> c_3()
            prefix#(L) -> c_4()
            zWadr#(XS,nil()) -> c_5()
            zWadr#(nil(),YS) -> c_7()
        - Weak TRS:
            app(cons(X),YS) -> cons(X)
            app(nil(),YS) -> YS
            from(X) -> cons(X)
            prefix(L) -> cons(nil())
            zWadr(XS,nil()) -> nil()
            zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X)))
            zWadr(nil(),YS) -> nil()
        - Signature:
            {app/2,from/1,prefix/1,zWadr/2,app#/2,from#/1,prefix#/1,zWadr#/2} / {cons/1,nil/0,c_1/0,c_2/0,c_3/0,c_4/0
            ,c_5/0,c_6/1,c_7/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {app#,from#,prefix#,zWadr#} and constructors {cons,nil}
    + Applied Processor:
        PredecessorEstimation {onSelection = all simple predecessor estimation selector}
    + Details:
        We estimate the number of application of
          {1}
        by application of
          Pre({1}) = {}.
        Here rules are labelled as follows:
          1: zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X)))
          2: app#(cons(X),YS) -> c_1()
          3: app#(nil(),YS) -> c_2()
          4: from#(X) -> c_3()
          5: prefix#(L) -> c_4()
          6: zWadr#(XS,nil()) -> c_5()
          7: zWadr#(nil(),YS) -> c_7()
* Step 5: RemoveWeakSuffixes.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak DPs:
            app#(cons(X),YS) -> c_1()
            app#(nil(),YS) -> c_2()
            from#(X) -> c_3()
            prefix#(L) -> c_4()
            zWadr#(XS,nil()) -> c_5()
            zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X)))
            zWadr#(nil(),YS) -> c_7()
        - Weak TRS:
            app(cons(X),YS) -> cons(X)
            app(nil(),YS) -> YS
            from(X) -> cons(X)
            prefix(L) -> cons(nil())
            zWadr(XS,nil()) -> nil()
            zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X)))
            zWadr(nil(),YS) -> nil()
        - Signature:
            {app/2,from/1,prefix/1,zWadr/2,app#/2,from#/1,prefix#/1,zWadr#/2} / {cons/1,nil/0,c_1/0,c_2/0,c_3/0,c_4/0
            ,c_5/0,c_6/1,c_7/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {app#,from#,prefix#,zWadr#} and constructors {cons,nil}
    + Applied Processor:
        RemoveWeakSuffixes
    + Details:
        Consider the dependency graph
          1:W:app#(cons(X),YS) -> c_1()
             
          
          2:W:app#(nil(),YS) -> c_2()
             
          
          3:W:from#(X) -> c_3()
             
          
          4:W:prefix#(L) -> c_4()
             
          
          5:W:zWadr#(XS,nil()) -> c_5()
             
          
          6:W:zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X)))
             -->_1 app#(nil(),YS) -> c_2():2
             -->_1 app#(cons(X),YS) -> c_1():1
          
          7:W:zWadr#(nil(),YS) -> c_7()
             
          
        The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed.
          7: zWadr#(nil(),YS) -> c_7()
          6: zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X)))
          5: zWadr#(XS,nil()) -> c_5()
          4: prefix#(L) -> c_4()
          3: from#(X) -> c_3()
          2: app#(nil(),YS) -> c_2()
          1: app#(cons(X),YS) -> c_1()
* Step 6: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            app(cons(X),YS) -> cons(X)
            app(nil(),YS) -> YS
            from(X) -> cons(X)
            prefix(L) -> cons(nil())
            zWadr(XS,nil()) -> nil()
            zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X)))
            zWadr(nil(),YS) -> nil()
        - Signature:
            {app/2,from/1,prefix/1,zWadr/2,app#/2,from#/1,prefix#/1,zWadr#/2} / {cons/1,nil/0,c_1/0,c_2/0,c_3/0,c_4/0
            ,c_5/0,c_6/1,c_7/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {app#,from#,prefix#,zWadr#} and constructors {cons,nil}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(1))