Runti Compl Full Rewri 10127 pair #381903820

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.0229110717773 seconds
cpu usage	0.052449896
max memory	1.0924032E7

stage attributes

key	value
output-size	5825
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(X)) -> mark(d(X))
            active(f(X)) -> f(active(X))
            active(f(f(X))) -> mark(c(f(g(f(X)))))
            active(h(X)) -> h(active(X))
            active(h(X)) -> mark(c(d(X)))
            c(ok(X)) -> ok(c(X))
            d(ok(X)) -> ok(d(X))
            f(mark(X)) -> mark(f(X))
            f(ok(X)) -> ok(f(X))
            g(ok(X)) -> ok(g(X))
            h(mark(X)) -> mark(h(X))
            h(ok(X)) -> ok(h(X))
            proper(c(X)) -> c(proper(X))
            proper(d(X)) -> d(proper(X))
            proper(f(X)) -> f(proper(X))
            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,c/1,d/1,f/1,g/1,h/1,proper/1,top/1} / {mark/1,ok/1}
        - Obligation:
             runtime complexity wrt. defined symbols {active,c,d,f,g,h,proper,top} and constructors {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(X)) -> mark(d(X))
            active(f(X)) -> f(active(X))
            active(f(f(X))) -> mark(c(f(g(f(X)))))
            active(h(X)) -> h(active(X))
            active(h(X)) -> mark(c(d(X)))
            c(ok(X)) -> ok(c(X))
            d(ok(X)) -> ok(d(X))
            f(mark(X)) -> mark(f(X))
            f(ok(X)) -> ok(f(X))
            g(ok(X)) -> ok(g(X))
            h(mark(X)) -> mark(h(X))
            h(ok(X)) -> ok(h(X))
            proper(c(X)) -> c(proper(X))
            proper(d(X)) -> d(proper(X))
            proper(f(X)) -> f(proper(X))
            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,c/1,d/1,f/1,g/1,h/1,proper/1,top/1} / {mark/1,ok/1}
        - Obligation:
             runtime complexity wrt. defined symbols {active,c,d,f,g,h,proper,top} and constructors {mark,ok}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          c(x){x -> ok(x)} =
            c(ok(x)) ->^+ ok(c(x))
              = C[c(x) = c(x){}]

** Step 1.b:1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            active(c(X)) -> mark(d(X))
            active(f(X)) -> f(active(X))
            active(f(f(X))) -> mark(c(f(g(f(X)))))
            active(h(X)) -> h(active(X))
            active(h(X)) -> mark(c(d(X)))
            c(ok(X)) -> ok(c(X))
            d(ok(X)) -> ok(d(X))
            f(mark(X)) -> mark(f(X))
            f(ok(X)) -> ok(f(X))
            g(ok(X)) -> ok(g(X))
            h(mark(X)) -> mark(h(X))
            h(ok(X)) -> ok(h(X))
            proper(c(X)) -> c(proper(X))
            proper(d(X)) -> d(proper(X))
            proper(f(X)) -> f(proper(X))
            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,c/1,d/1,f/1,g/1,h/1,proper/1,top/1} / {mark/1,ok/1}
        - Obligation:
             runtime complexity wrt. defined symbols {active,c,d,f,g,h,proper,top} and constructors {mark,ok}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127