/export/starexec/sandbox/solver/bin/starexec_run_tct_dci /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:
            a(y,0()) -> b(y,0())
            b(b(0(),y),x) -> y
            c(c(c(y))) -> c(c(a(a(c(b(0(),y)),0()),0())))
        - Signature:
            {a/2,b/2,c/1} / {0/0}
        - Obligation:
            innermost derivational complexity wrt. signature {0,a,b,c}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 2.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_1() -> 1
          0_1() -> 2
          0_2() -> 8
          a_0(1,1) -> 1
          a_1(5,2) -> 4
          a_1(6,2) -> 5
          b_0(1,1) -> 1
          b_1(1,2) -> 1
          b_1(2,1) -> 7
          b_1(2,3) -> 7
          b_1(2,4) -> 7
          b_2(5,8) -> 4
          b_2(6,8) -> 5
          c_0(1) -> 1
          c_1(3) -> 1
          c_1(4) -> 3
          c_1(7) -> 6
          2 -> 1
* Step 2: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(y,0()) -> b(y,0())
            b(b(0(),y),x) -> y
            c(c(c(y))) -> c(c(a(a(c(b(0(),y)),0()),0())))
        - Signature:
            {a/2,b/2,c/1} / {0/0}
        - Obligation:
            innermost derivational complexity wrt. signature {0,a,b,c}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))