Runti Compl Full Rewri 10127 pair #381903744

details

property	value
status	complete
benchmark	Ex1_Zan97_C.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n058.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.270532846451 seconds
cpu usage	15.34472531
max memory	4.3917312E7

stage attributes

key	value
output-size	5771
starexec-result	WORST_CASE(Omega(n^1),O(n^1))

output

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


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


WORST_CASE(Omega(n^1),O(n^1))
* Step 1: Sum WORST_CASE(Omega(n^1),O(n^1))
    + Considered Problem:
        - Strict TRS:
            active(c()) -> mark(d())
            active(g(X)) -> mark(h(X))
            active(h(d())) -> mark(g(c()))
            g(ok(X)) -> ok(g(X))
            h(ok(X)) -> ok(h(X))
            proper(c()) -> ok(c())
            proper(d()) -> ok(d())
            proper(g(X)) -> g(proper(X))
            proper(h(X)) -> h(proper(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
        - Signature:
            {active/1,g/1,h/1,proper/1,top/1} / {c/0,d/0,mark/1,ok/1}
        - Obligation:
             runtime complexity wrt. defined symbols {active,g,h,proper,top} and constructors {c,d,mark,ok}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            active(c()) -> mark(d())
            active(g(X)) -> mark(h(X))
            active(h(d())) -> mark(g(c()))
            g(ok(X)) -> ok(g(X))
            h(ok(X)) -> ok(h(X))
            proper(c()) -> ok(c())
            proper(d()) -> ok(d())
            proper(g(X)) -> g(proper(X))
            proper(h(X)) -> h(proper(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
        - Signature:
            {active/1,g/1,h/1,proper/1,top/1} / {c/0,d/0,mark/1,ok/1}
        - Obligation:
             runtime complexity wrt. defined symbols {active,g,h,proper,top} and constructors {c,d,mark,ok}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          g(x){x -> ok(x)} =
            g(ok(x)) ->^+ ok(g(x))
              = C[g(x) = g(x){}]

** Step 1.b:1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            active(c()) -> mark(d())
            active(g(X)) -> mark(h(X))
            active(h(d())) -> mark(g(c()))
            g(ok(X)) -> ok(g(X))
            h(ok(X)) -> ok(h(X))
            proper(c()) -> ok(c())
            proper(d()) -> ok(d())
            proper(g(X)) -> g(proper(X))
            proper(h(X)) -> h(proper(X))
            top(mark(X)) -> top(proper(X))
            top(ok(X)) -> top(active(X))
        - Signature:
            {active/1,g/1,h/1,proper/1,top/1} / {c/0,d/0,mark/1,ok/1}
        - Obligation:
             runtime complexity wrt. defined symbols {active,g,h,proper,top} and constructors {c,d,mark,ok}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 4.
        The enriched problem is compatible with follwoing automaton.
          active_0(2) -> 1
          active_0(3) -> 1
          active_0(6) -> 1
          active_0(7) -> 1
          active_1(2) -> 14
          active_1(3) -> 14
          active_1(6) -> 14
          active_1(7) -> 14
          active_2(10) -> 15
          active_2(13) -> 15
          active_3(16) -> 17
          active_4(18) -> 19
          c_0() -> 2
          c_1() -> 13
          d_0() -> 3
          d_1() -> 10
          d_2() -> 16
          d_3() -> 18
          g_0(2) -> 4
          g_0(3) -> 4
          g_0(6) -> 4
          g_0(7) -> 4

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Runti Compl Full Rewri 10127