Runti Compl Full Rewri 10127 pair #381902618

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.0790641307831 seconds
cpu usage	0.31640389
max memory	2.1602304E7

stage attributes

key	value
output-size	2902
starexec-result	WORST_CASE(?,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(?,O(n^1))
* Step 1: Sum 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(0())) -> g(d(1()))
            g(c(1())) -> g(d(0()))
            g(d(x)) -> x
        - Signature:
            {f/1,g/1} / {0/0,1/0,c/1,d/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f,g} and constructors {0,1,c,d}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: 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(0())) -> g(d(1()))
            g(c(1())) -> g(d(0()))
            g(d(x)) -> x
        - Signature:
            {f/1,g/1} / {0/0,1/0,c/1,d/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f,g} and constructors {0,1,c,d}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          0_0() -> 1
          0_0() -> 6
          0_1() -> 6
          0_1() -> 8
          1_0() -> 2
          1_0() -> 6
          1_1() -> 6
          1_1() -> 8
          c_0(1) -> 3
          c_0(1) -> 6
          c_0(2) -> 3
          c_0(2) -> 6
          c_0(3) -> 3
          c_0(3) -> 6
          c_0(4) -> 3
          c_0(4) -> 6
          d_0(1) -> 4
          d_0(1) -> 6
          d_0(2) -> 4
          d_0(2) -> 6
          d_0(3) -> 4
          d_0(3) -> 6
          d_0(4) -> 4
          d_0(4) -> 6
          d_1(8) -> 7
          f_0(1) -> 5
          f_0(2) -> 5
          f_0(3) -> 5
          f_0(4) -> 5
          g_0(1) -> 6
          g_0(2) -> 6
          g_0(3) -> 6
          g_0(4) -> 6
          g_1(7) -> 6
          1 -> 6
          2 -> 6
          3 -> 6
          4 -> 6
          8 -> 6
* Step 3: 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(0())) -> g(d(1()))
            g(c(1())) -> g(d(0()))
            g(d(x)) -> x
        - Signature:
            {f/1,g/1} / {0/0,1/0,c/1,d/1}
        - Obligation:
             runtime complexity wrt. defined symbols {f,g} and constructors {0,1,c,d}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127