Runti Compl Full Rewri 10127 pair #381903167

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.0217740535736 seconds
cpu usage	0.043923361
max memory	7417856.0

stage attributes

key	value
output-size	5255
starexec-result	WORST_CASE(?,O(n^1))

output

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


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


WORST_CASE(?,O(n^1))
* Step 1: Sum WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__f(X)) -> f(X)
            f(X) -> n__f(X)
            f(0()) -> cons(0(),n__f(s(0())))
            f(s(0())) -> f(p(s(0())))
            p(s(0())) -> 0()
        - Signature:
            {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: ToInnermost WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__f(X)) -> f(X)
            f(X) -> n__f(X)
            f(0()) -> cons(0(),n__f(s(0())))
            f(s(0())) -> f(p(s(0())))
            p(s(0())) -> 0()
        - Signature:
            {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,s}
    + Applied Processor:
        ToInnermost
    + Details:
        switch to innermost, as the system is overlay and right linear and does not contain weak rules
* Step 3: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__f(X)) -> f(X)
            f(X) -> n__f(X)
            f(0()) -> cons(0(),n__f(s(0())))
            f(s(0())) -> f(p(s(0())))
            p(s(0())) -> 0()
        - Signature:
            {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,s}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 2.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_0() -> 2
          0_1() -> 6
          0_1() -> 8
          0_1() -> 11
          0_2() -> 1
          0_2() -> 2
          activate_0(1) -> 2
          activate_0(3) -> 2
          activate_0(5) -> 2
          activate_0(7) -> 2
          cons_0(1,1) -> 2
          cons_0(1,1) -> 3
          cons_0(1,3) -> 2
          cons_0(1,3) -> 3
          cons_0(1,5) -> 2
          cons_0(1,5) -> 3
          cons_0(1,7) -> 2
          cons_0(1,7) -> 3
          cons_0(3,1) -> 2
          cons_0(3,1) -> 3
          cons_0(3,3) -> 2
          cons_0(3,3) -> 3
          cons_0(3,5) -> 2
          cons_0(3,5) -> 3
          cons_0(3,7) -> 2
          cons_0(3,7) -> 3
          cons_0(5,1) -> 2
          cons_0(5,1) -> 3
          cons_0(5,3) -> 2
          cons_0(5,3) -> 3
          cons_0(5,5) -> 2
          cons_0(5,5) -> 3
          cons_0(5,7) -> 2
          cons_0(5,7) -> 3
          cons_0(7,1) -> 2
          cons_0(7,1) -> 3
          cons_0(7,3) -> 2
          cons_0(7,3) -> 3
          cons_0(7,5) -> 2
          cons_0(7,5) -> 3

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127