Runti Compl Full Rewri 10127 pair #381903466

details

property	value
status	timeout (wallclock)
benchmark	ExSec4_2_DLMMU04_GM.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	Transformed_CSR_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.140949011 seconds
cpu usage	850.313082769
max memory	3.0589202432E10

stage attributes

unavailable

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:
            a__afterNth(N,XS) -> a__snd(a__splitAt(mark(N),mark(XS)))
            a__afterNth(X1,X2) -> afterNth(X1,X2)
            a__fst(X) -> fst(X)
            a__fst(pair(XS,YS)) -> mark(XS)
            a__head(X) -> head(X)
            a__head(cons(N,XS)) -> mark(N)
            a__natsFrom(N) -> cons(mark(N),natsFrom(s(N)))
            a__natsFrom(X) -> natsFrom(X)
            a__sel(N,XS) -> a__head(a__afterNth(mark(N),mark(XS)))
            a__sel(X1,X2) -> sel(X1,X2)
            a__snd(X) -> snd(X)
            a__snd(pair(XS,YS)) -> mark(YS)
            a__splitAt(X1,X2) -> splitAt(X1,X2)
            a__splitAt(0(),XS) -> pair(nil(),mark(XS))
            a__splitAt(s(N),cons(X,XS)) -> a__u(a__splitAt(mark(N),mark(XS)),N,X,XS)
            a__tail(X) -> tail(X)
            a__tail(cons(N,XS)) -> mark(XS)
            a__take(N,XS) -> a__fst(a__splitAt(mark(N),mark(XS)))
            a__take(X1,X2) -> take(X1,X2)
            a__u(X1,X2,X3,X4) -> u(X1,X2,X3,X4)
            a__u(pair(YS,ZS),N,X,XS) -> pair(cons(mark(X),YS),mark(ZS))
            mark(0()) -> 0()
            mark(afterNth(X1,X2)) -> a__afterNth(mark(X1),mark(X2))
            mark(cons(X1,X2)) -> cons(mark(X1),X2)
            mark(fst(X)) -> a__fst(mark(X))
            mark(head(X)) -> a__head(mark(X))
            mark(natsFrom(X)) -> a__natsFrom(mark(X))
            mark(nil()) -> nil()
            mark(pair(X1,X2)) -> pair(mark(X1),mark(X2))
            mark(s(X)) -> s(mark(X))
            mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2))
            mark(snd(X)) -> a__snd(mark(X))
            mark(splitAt(X1,X2)) -> a__splitAt(mark(X1),mark(X2))
            mark(tail(X)) -> a__tail(mark(X))
            mark(take(X1,X2)) -> a__take(mark(X1),mark(X2))
            mark(u(X1,X2,X3,X4)) -> a__u(mark(X1),X2,X3,X4)
        - Signature:
            {a__afterNth/2,a__fst/1,a__head/1,a__natsFrom/1,a__sel/2,a__snd/1,a__splitAt/2,a__tail/1,a__take/2,a__u/4
            ,mark/1} / {0/0,afterNth/2,cons/2,fst/1,head/1,natsFrom/1,nil/0,pair/2,s/1,sel/2,snd/1,splitAt/2,tail/1
            ,take/2,u/4}
        - Obligation:
             runtime complexity wrt. defined symbols {a__afterNth,a__fst,a__head,a__natsFrom,a__sel,a__snd,a__splitAt
            ,a__tail,a__take,a__u,mark} and constructors {0,afterNth,cons,fst,head,natsFrom,nil,pair,s,sel,snd,splitAt
            ,tail,take,u}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            a__afterNth(N,XS) -> a__snd(a__splitAt(mark(N),mark(XS)))
            a__afterNth(X1,X2) -> afterNth(X1,X2)
            a__fst(X) -> fst(X)
            a__fst(pair(XS,YS)) -> mark(XS)
            a__head(X) -> head(X)
            a__head(cons(N,XS)) -> mark(N)
            a__natsFrom(N) -> cons(mark(N),natsFrom(s(N)))
            a__natsFrom(X) -> natsFrom(X)
            a__sel(N,XS) -> a__head(a__afterNth(mark(N),mark(XS)))
            a__sel(X1,X2) -> sel(X1,X2)
            a__snd(X) -> snd(X)
            a__snd(pair(XS,YS)) -> mark(YS)
            a__splitAt(X1,X2) -> splitAt(X1,X2)
            a__splitAt(0(),XS) -> pair(nil(),mark(XS))
            a__splitAt(s(N),cons(X,XS)) -> a__u(a__splitAt(mark(N),mark(XS)),N,X,XS)
            a__tail(X) -> tail(X)
            a__tail(cons(N,XS)) -> mark(XS)
            a__take(N,XS) -> a__fst(a__splitAt(mark(N),mark(XS)))
            a__take(X1,X2) -> take(X1,X2)
            a__u(X1,X2,X3,X4) -> u(X1,X2,X3,X4)
            a__u(pair(YS,ZS),N,X,XS) -> pair(cons(mark(X),YS),mark(ZS))
            mark(0()) -> 0()
            mark(afterNth(X1,X2)) -> a__afterNth(mark(X1),mark(X2))
            mark(cons(X1,X2)) -> cons(mark(X1),X2)
            mark(fst(X)) -> a__fst(mark(X))
            mark(head(X)) -> a__head(mark(X))
            mark(natsFrom(X)) -> a__natsFrom(mark(X))
            mark(nil()) -> nil()
            mark(pair(X1,X2)) -> pair(mark(X1),mark(X2))
            mark(s(X)) -> s(mark(X))
            mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2))
            mark(snd(X)) -> a__snd(mark(X))
            mark(splitAt(X1,X2)) -> a__splitAt(mark(X1),mark(X2))
            mark(tail(X)) -> a__tail(mark(X))
            mark(take(X1,X2)) -> a__take(mark(X1),mark(X2))
            mark(u(X1,X2,X3,X4)) -> a__u(mark(X1),X2,X3,X4)
        - Signature:
            {a__afterNth/2,a__fst/1,a__head/1,a__natsFrom/1,a__sel/2,a__snd/1,a__splitAt/2,a__tail/1,a__take/2,a__u/4
            ,mark/1} / {0/0,afterNth/2,cons/2,fst/1,head/1,natsFrom/1,nil/0,pair/2,s/1,sel/2,snd/1,splitAt/2,tail/1

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127