Runti Compl Full Rewri 10127 pair #381902799

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	1.79946208 seconds
cpu usage	5.149048539
max memory	6.1861888E7

stage attributes

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

WORST_CASE(Omega(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