Runti Compl Full Rewri 10127 pair #381903556

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.196084976 seconds
cpu usage	587.300661021
max memory	2.223628288E9

stage attributes

key	value
output-size	3200
starexec-result	WORST_CASE(Omega(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),?)
* Step 1: Sum WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            0() -> n__0()
            activate(X) -> X
            activate(n__0()) -> 0()
            activate(n__div(X1,X2)) -> div(activate(X1),X2)
            activate(n__minus(X1,X2)) -> minus(X1,X2)
            activate(n__s(X)) -> s(activate(X))
            div(X1,X2) -> n__div(X1,X2)
            div(0(),n__s(Y)) -> 0()
            div(s(X),n__s(Y)) -> if(geq(X,activate(Y)),n__s(n__div(n__minus(X,activate(Y)),n__s(activate(Y)))),n__0())
            geq(X,n__0()) -> true()
            geq(n__0(),n__s(Y)) -> false()
            geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
            if(false(),X,Y) -> activate(Y)
            if(true(),X,Y) -> activate(X)
            minus(X1,X2) -> n__minus(X1,X2)
            minus(n__0(),Y) -> 0()
            minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
            s(X) -> n__s(X)
        - Signature:
            {0/0,activate/1,div/2,geq/2,if/3,minus/2,s/1} / {false/0,n__0/0,n__div/2,n__minus/2,n__s/1,true/0}
        - Obligation:
             runtime complexity wrt. defined symbols {0,activate,div,geq,if,minus,s} and constructors {false,n__0,n__div
            ,n__minus,n__s,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            0() -> n__0()
            activate(X) -> X
            activate(n__0()) -> 0()
            activate(n__div(X1,X2)) -> div(activate(X1),X2)
            activate(n__minus(X1,X2)) -> minus(X1,X2)
            activate(n__s(X)) -> s(activate(X))
            div(X1,X2) -> n__div(X1,X2)
            div(0(),n__s(Y)) -> 0()
            div(s(X),n__s(Y)) -> if(geq(X,activate(Y)),n__s(n__div(n__minus(X,activate(Y)),n__s(activate(Y)))),n__0())
            geq(X,n__0()) -> true()
            geq(n__0(),n__s(Y)) -> false()
            geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y))
            if(false(),X,Y) -> activate(Y)
            if(true(),X,Y) -> activate(X)
            minus(X1,X2) -> n__minus(X1,X2)
            minus(n__0(),Y) -> 0()
            minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y))
            s(X) -> n__s(X)
        - Signature:
            {0/0,activate/1,div/2,geq/2,if/3,minus/2,s/1} / {false/0,n__0/0,n__div/2,n__minus/2,n__s/1,true/0}
        - Obligation:
             runtime complexity wrt. defined symbols {0,activate,div,geq,if,minus,s} and constructors {false,n__0,n__div
            ,n__minus,n__s,true}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          activate(x){x -> n__div(x,y)} =
            activate(n__div(x,y)) ->^+ div(activate(x),y)
              = C[activate(x) = activate(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