Runti Compl Full Rewri 10127 pair #381902985

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.0513088703156 seconds
cpu usage	0.219369658
max memory	1.4741504E7

stage attributes

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

** Step 1.b:1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(f(x)) -> f(c(f(x)))
            f(f(x)) -> f(d(f(x)))
            g(c(x)) -> x
            g(c(1())) -> g(d(h(0())))
            g(c(h(0()))) -> g(d(1()))
            g(d(x)) -> x
            g(h(x)) -> g(x)
        - Signature:
            {f/1,g/1} / {0/0,1/0,c/1,d/1,h/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f,g} and constructors {0,1,c,d,h}
    + Applied Processor:
        Bounds {initialAutomaton = minimal, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_0() -> 2
          0_1() -> 5
          1_0() -> 1
          1_0() -> 2
          1_1() -> 1
          1_1() -> 4
          c_0(2) -> 1
          c_0(2) -> 2
          d_0(2) -> 1
          d_0(2) -> 2
          d_1(4) -> 3
          f_0(2) -> 1
          g_0(2) -> 1
          g_1(2) -> 1
          g_1(3) -> 1
          h_0(2) -> 1
          h_0(2) -> 2
          h_1(5) -> 1
          h_1(5) -> 4
          2 -> 1
          4 -> 1
** Step 1.b:2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(f(x)) -> f(c(f(x)))
            f(f(x)) -> f(d(f(x)))
            g(c(x)) -> x
            g(c(1())) -> g(d(h(0())))
            g(c(h(0()))) -> g(d(1()))
            g(d(x)) -> x
            g(h(x)) -> g(x)
        - Signature:
            {f/1,g/1} / {0/0,1/0,c/1,d/1,h/1}

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127