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

WORST_CASE(?,O(n^1))