Runti Compl Inner Rewri 22807 pair #381904932

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	294.04323101 seconds
cpu usage	1077.52987955
max memory	3.578466304E9

stage attributes

key	value
output-size	2076
starexec-result	WORST_CASE(Omega(n^1),?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(Omega(n^1),?)
* Step 1: Sum WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            add(0(),X) -> X
            add(s(X),Y) -> s(add(X,Y))
            fact(X) -> if(zero(X),s(0()),prod(X,fact(p(X))))
            if(false(),X,Y) -> Y
            if(true(),X,Y) -> X
            p(s(X)) -> X
            prod(0(),X) -> 0()
            prod(s(X),Y) -> add(Y,prod(X,Y))
            zero(0()) -> true()
            zero(s(X)) -> false()
        - Signature:
            {add/2,fact/1,if/3,p/1,prod/2,zero/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {add,fact,if,p,prod,zero} and constructors {0,false,s
            ,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            add(0(),X) -> X
            add(s(X),Y) -> s(add(X,Y))
            fact(X) -> if(zero(X),s(0()),prod(X,fact(p(X))))
            if(false(),X,Y) -> Y
            if(true(),X,Y) -> X
            p(s(X)) -> X
            prod(0(),X) -> 0()
            prod(s(X),Y) -> add(Y,prod(X,Y))
            zero(0()) -> true()
            zero(s(X)) -> false()
        - Signature:
            {add/2,fact/1,if/3,p/1,prod/2,zero/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {add,fact,if,p,prod,zero} and constructors {0,false,s
            ,true}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          add(x,y){x -> s(x)} =
            add(s(x),y) ->^+ s(add(x,y))
              = C[add(x,y) = add(x,y){}]

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 Inner Rewri 22807