Runti Compl Inner Rewri 22807 pair #381905091

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	10.5425131321 seconds
cpu usage	42.862145546
max memory	1.41238272E8

stage attributes

key	value
output-size	147121
starexec-result	WORST_CASE(?,O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /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:
            U11(tt(),N,XS) -> U12(tt(),activate(N),activate(XS))
            U12(tt(),N,XS) -> snd(splitAt(activate(N),activate(XS)))
            U21(tt(),X) -> U22(tt(),activate(X))
            U22(tt(),X) -> activate(X)
            U31(tt(),N) -> U32(tt(),activate(N))
            U32(tt(),N) -> activate(N)
            U41(tt(),N,XS) -> U42(tt(),activate(N),activate(XS))
            U42(tt(),N,XS) -> head(afterNth(activate(N),activate(XS)))
            U51(tt(),Y) -> U52(tt(),activate(Y))
            U52(tt(),Y) -> activate(Y)
            U61(tt(),N,X,XS) -> U62(tt(),activate(N),activate(X),activate(XS))
            U62(tt(),N,X,XS) -> U63(tt(),activate(N),activate(X),activate(XS))
            U63(tt(),N,X,XS) -> U64(splitAt(activate(N),activate(XS)),activate(X))
            U64(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS)
            U71(tt(),XS) -> U72(tt(),activate(XS))
            U72(tt(),XS) -> activate(XS)
            U81(tt(),N,XS) -> U82(tt(),activate(N),activate(XS))
            U82(tt(),N,XS) -> fst(splitAt(activate(N),activate(XS)))
            activate(X) -> X
            activate(n__natsFrom(X)) -> natsFrom(X)
            afterNth(N,XS) -> U11(tt(),N,XS)
            fst(pair(X,Y)) -> U21(tt(),X)
            head(cons(N,XS)) -> U31(tt(),N)
            natsFrom(N) -> cons(N,n__natsFrom(s(N)))
            natsFrom(X) -> n__natsFrom(X)
            sel(N,XS) -> U41(tt(),N,XS)
            snd(pair(X,Y)) -> U51(tt(),Y)
            splitAt(0(),XS) -> pair(nil(),XS)
            splitAt(s(N),cons(X,XS)) -> U61(tt(),N,X,activate(XS))
            tail(cons(N,XS)) -> U71(tt(),activate(XS))
            take(N,XS) -> U81(tt(),N,XS)
        - Signature:
            {U11/3,U12/3,U21/2,U22/2,U31/2,U32/2,U41/3,U42/3,U51/2,U52/2,U61/4,U62/4,U63/4,U64/2,U71/2,U72/2,U81/3,U82/3
            ,activate/1,afterNth/2,fst/1,head/1,natsFrom/1,sel/2,snd/1,splitAt/2,tail/1,take/2} / {0/0,cons/2
            ,n__natsFrom/1,nil/0,pair/2,s/1,tt/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {U11,U12,U21,U22,U31,U32,U41,U42,U51,U52,U61,U62,U63,U64
            ,U71,U72,U81,U82,activate,afterNth,fst,head,natsFrom,sel,snd,splitAt,tail,take} and constructors {0,cons
            ,n__natsFrom,nil,pair,s,tt}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DependencyPairs WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            U11(tt(),N,XS) -> U12(tt(),activate(N),activate(XS))
            U12(tt(),N,XS) -> snd(splitAt(activate(N),activate(XS)))
            U21(tt(),X) -> U22(tt(),activate(X))
            U22(tt(),X) -> activate(X)
            U31(tt(),N) -> U32(tt(),activate(N))
            U32(tt(),N) -> activate(N)
            U41(tt(),N,XS) -> U42(tt(),activate(N),activate(XS))
            U42(tt(),N,XS) -> head(afterNth(activate(N),activate(XS)))
            U51(tt(),Y) -> U52(tt(),activate(Y))
            U52(tt(),Y) -> activate(Y)
            U61(tt(),N,X,XS) -> U62(tt(),activate(N),activate(X),activate(XS))
            U62(tt(),N,X,XS) -> U63(tt(),activate(N),activate(X),activate(XS))
            U63(tt(),N,X,XS) -> U64(splitAt(activate(N),activate(XS)),activate(X))
            U64(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS)
            U71(tt(),XS) -> U72(tt(),activate(XS))
            U72(tt(),XS) -> activate(XS)
            U81(tt(),N,XS) -> U82(tt(),activate(N),activate(XS))
            U82(tt(),N,XS) -> fst(splitAt(activate(N),activate(XS)))
            activate(X) -> X
            activate(n__natsFrom(X)) -> natsFrom(X)
            afterNth(N,XS) -> U11(tt(),N,XS)
            fst(pair(X,Y)) -> U21(tt(),X)
            head(cons(N,XS)) -> U31(tt(),N)
            natsFrom(N) -> cons(N,n__natsFrom(s(N)))
            natsFrom(X) -> n__natsFrom(X)
            sel(N,XS) -> U41(tt(),N,XS)
            snd(pair(X,Y)) -> U51(tt(),Y)
            splitAt(0(),XS) -> pair(nil(),XS)
            splitAt(s(N),cons(X,XS)) -> U61(tt(),N,X,activate(XS))
            tail(cons(N,XS)) -> U71(tt(),activate(XS))
            take(N,XS) -> U81(tt(),N,XS)
        - Signature:
            {U11/3,U12/3,U21/2,U22/2,U31/2,U32/2,U41/3,U42/3,U51/2,U52/2,U61/4,U62/4,U63/4,U64/2,U71/2,U72/2,U81/3,U82/3
            ,activate/1,afterNth/2,fst/1,head/1,natsFrom/1,sel/2,snd/1,splitAt/2,tail/1,take/2} / {0/0,cons/2
            ,n__natsFrom/1,nil/0,pair/2,s/1,tt/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {U11,U12,U21,U22,U31,U32,U41,U42,U51,U52,U61,U62,U63,U64
            ,U71,U72,U81,U82,activate,afterNth,fst,head,natsFrom,sel,snd,splitAt,tail,take} and constructors {0,cons
            ,n__natsFrom,nil,pair,s,tt}
    + Applied Processor:
        DependencyPairs {dpKind_ = DT}
    + Details:
        We add the following dependency tuples:

popout

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

job log

popout

actions all output return to Runti Compl Inner Rewri 22807