Runti Compl Full Rewri 10127 pair #381903110

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.019143819809 seconds
cpu usage	0.020694723
max memory	3723264.0

stage attributes

key	value
output-size	4104
starexec-result	WORST_CASE(Omega(n^1),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(Omega(n^1),O(n^1))
* Step 1: Sum WORST_CASE(Omega(n^1),O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(+(x,y)) -> *(f(x),f(y))
            f(+(x,s(0()))) -> +(s(s(0())),f(x))
            f(0()) -> s(0())
            f(s(0())) -> *(s(s(0())),f(0()))
            f(s(0())) -> s(s(0()))
        - Signature:
            {f/1} / {*/2,+/2,0/0,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {*,+,0,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            f(+(x,y)) -> *(f(x),f(y))
            f(+(x,s(0()))) -> +(s(s(0())),f(x))
            f(0()) -> s(0())
            f(s(0())) -> *(s(s(0())),f(0()))
            f(s(0())) -> s(s(0()))
        - Signature:
            {f/1} / {*/2,+/2,0/0,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {*,+,0,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          f(x){x -> +(x,y)} =
            f(+(x,y)) ->^+ *(f(x),f(y))
              = C[f(x) = f(x){}]

** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(+(x,y)) -> *(f(x),f(y))
            f(+(x,s(0()))) -> +(s(s(0())),f(x))
            f(0()) -> s(0())
            f(s(0())) -> *(s(s(0())),f(0()))
            f(s(0())) -> s(s(0()))
        - Signature:
            {f/1} / {*/2,+/2,0/0,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {*,+,0,s}
    + Applied Processor:
        ToInnermost
    + Details:
        switch to innermost, as the system is overlay and right linear and does not contain weak rules
** Step 1.b:2: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(+(x,y)) -> *(f(x),f(y))
            f(+(x,s(0()))) -> +(s(s(0())),f(x))
            f(0()) -> s(0())
            f(s(0())) -> *(s(s(0())),f(0()))
            f(s(0())) -> s(s(0()))
        - Signature:
            {f/1} / {*/2,+/2,0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {*,+,0,s}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 2.
        The enriched problem is compatible with follwoing automaton.
          *_0(2,2) -> 2
          *_1(3,4) -> 1
          *_1(4,4) -> 3
          *_1(4,4) -> 4
          *_1(5,8) -> 1
          *_1(5,8) -> 3
          *_1(5,8) -> 4
          +_0(2,2) -> 2
          +_1(5,4) -> 1
          +_1(5,4) -> 3
          +_1(5,4) -> 4
          0_0() -> 2
          0_1() -> 7
          0_2() -> 9
          f_0(2) -> 1
          f_1(2) -> 3
          f_1(2) -> 4
          f_1(7) -> 8
          s_0(2) -> 2
          s_1(6) -> 1
          s_1(6) -> 3
          s_1(6) -> 4
          s_1(6) -> 5
          s_1(7) -> 1

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127