Runti Compl Full Rewri 10127 pair #381902822

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.020320892334 seconds
cpu usage	0.037878574
max memory	3805184.0

stage attributes

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

** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(a(),a()) -> f(a(),b())
            f(a(),b()) -> f(s(a()),c())
            f(c(),c()) -> f(a(),a())
            f(s(X),c()) -> f(X,c())
        - Signature:
            {f/2} / {a/0,b/0,c/0,s/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f} and constructors {a,b,c,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(a(),a()) -> f(a(),b())
            f(a(),b()) -> f(s(a()),c())
            f(c(),c()) -> f(a(),a())
            f(s(X),c()) -> f(X,c())
        - Signature:
            {f/2} / {a/0,b/0,c/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {a,b,c,s}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 4.
        The enriched problem is compatible with follwoing automaton.
          a_0() -> 2
          a_1() -> 3
          a_2() -> 7
          a_3() -> 10
          b_0() -> 2
          b_1() -> 4
          b_2() -> 9
          c_0() -> 2
          c_1() -> 4
          c_2() -> 6
          c_3() -> 8
          c_4() -> 11
          f_0(2,2) -> 1
          f_1(2,4) -> 1
          f_1(3,3) -> 1
          f_1(3,4) -> 1
          f_2(3,6) -> 1
          f_2(5,6) -> 1
          f_2(7,9) -> 1
          f_3(7,8) -> 1
          f_4(10,11) -> 1
          s_0(2) -> 2
          s_1(3) -> 3
          s_2(7) -> 5
          s_3(10) -> 7
** Step 1.b:3: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127