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


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


WORST_CASE(?,O(n^1))
* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'()))
            f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'()))
        - Signature:
            {f/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3}
        - Obligation:
             derivational complexity wrt. signature {.,a,b,b',c,d,d',e,f,g,h,i,if}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          ._0(1,1) -> 1
          ._1(7,8) -> 5
          ._1(14,12) -> 15
          ._1(16,12) -> 9
          a_0() -> 1
          a_1() -> 13
          b_0() -> 1
          b_1() -> 7
          b_1() -> 14
          b'_0() -> 1
          b'_1() -> 16
          c_0() -> 1
          c_1() -> 9
          c_1() -> 12
          d_0() -> 1
          d_1() -> 6
          d'_0() -> 1
          d'_1() -> 10
          e_0() -> 1
          e_1() -> 2
          f_0(1,1) -> 1
          f_1(5,6) -> 3
          f_1(9,10) -> 4
          f_1(15,10) -> 3
          g_0(1,1) -> 1
          g_1(11,12) -> 8
          h_0(1,1) -> 1
          h_1(13,14) -> 11
          i_0(1,1,1) -> 1
          if_0(1,1,1) -> 1
          if_1(2,3,4) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'()))
            f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'()))
        - Signature:
            {f/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3}
        - Obligation:
             derivational complexity wrt. signature {.,a,b,b',c,d,d',e,f,g,h,i,if}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))