/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:
            .(x,1()) -> x
            .(x,i(x)) -> 1()
            .(y,.(i(y),z)) -> z
            .(1(),x) -> x
            .(i(x),x) -> 1()
            .(i(y),.(y,z)) -> z
            i(1()) -> 1()
            i(i(x)) -> x
        - Signature:
            {./2,i/1} / {1/0}
        - Obligation:
             derivational complexity wrt. signature {.,1,i}
    + 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_0() -> 1
          1_1() -> 1
          i_0(1) -> 1
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            .(x,1()) -> x
            .(x,i(x)) -> 1()
            .(y,.(i(y),z)) -> z
            .(1(),x) -> x
            .(i(x),x) -> 1()
            .(i(y),.(y,z)) -> z
            i(1()) -> 1()
            i(i(x)) -> x
        - Signature:
            {./2,i/1} / {1/0}
        - Obligation:
             derivational complexity wrt. signature {.,1,i}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))