Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905178
details
property
value
status
complete
benchmark
LISTUTILITIES_nosorts_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
6.84186697006 seconds
cpu usage
12.388551378
max memory
6.8268032E7
stage attributes
key
value
output-size
47549
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,X,XS) -> U12(splitAt(activate(N),activate(XS)),activate(X)) U12(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS) activate(X) -> X activate(n__natsFrom(X)) -> natsFrom(X) afterNth(N,XS) -> snd(splitAt(N,XS)) and(tt(),X) -> activate(X) fst(pair(X,Y)) -> X head(cons(N,XS)) -> N natsFrom(N) -> cons(N,n__natsFrom(s(N))) natsFrom(X) -> n__natsFrom(X) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(X,Y)) -> Y splitAt(0(),XS) -> pair(nil(),XS) splitAt(s(N),cons(X,XS)) -> U11(tt(),N,X,activate(XS)) tail(cons(N,XS)) -> activate(XS) take(N,XS) -> fst(splitAt(N,XS)) - Signature: {U11/4,U12/2,activate/1,afterNth/2,and/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,activate,afterNth,and,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,X,XS) -> U12(splitAt(activate(N),activate(XS)),activate(X)) U12(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS) activate(X) -> X activate(n__natsFrom(X)) -> natsFrom(X) afterNth(N,XS) -> snd(splitAt(N,XS)) and(tt(),X) -> activate(X) fst(pair(X,Y)) -> X head(cons(N,XS)) -> N natsFrom(N) -> cons(N,n__natsFrom(s(N))) natsFrom(X) -> n__natsFrom(X) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(X,Y)) -> Y splitAt(0(),XS) -> pair(nil(),XS) splitAt(s(N),cons(X,XS)) -> U11(tt(),N,X,activate(XS)) tail(cons(N,XS)) -> activate(XS) take(N,XS) -> fst(splitAt(N,XS)) - Signature: {U11/4,U12/2,activate/1,afterNth/2,and/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,activate,afterNth,and,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: Strict DPs U11#(tt(),N,X,XS) -> c_1(U12#(splitAt(activate(N),activate(XS)),activate(X)) ,splitAt#(activate(N),activate(XS)) ,activate#(N) ,activate#(XS) ,activate#(X)) U12#(pair(YS,ZS),X) -> c_2(activate#(X)) activate#(X) -> c_3() activate#(n__natsFrom(X)) -> c_4(natsFrom#(X)) afterNth#(N,XS) -> c_5(snd#(splitAt(N,XS)),splitAt#(N,XS)) and#(tt(),X) -> c_6(activate#(X)) fst#(pair(X,Y)) -> c_7() head#(cons(N,XS)) -> c_8() natsFrom#(N) -> c_9() natsFrom#(X) -> c_10() sel#(N,XS) -> c_11(head#(afterNth(N,XS)),afterNth#(N,XS)) snd#(pair(X,Y)) -> c_12() splitAt#(0(),XS) -> c_13() splitAt#(s(N),cons(X,XS)) -> c_14(U11#(tt(),N,X,activate(XS)),activate#(XS)) tail#(cons(N,XS)) -> c_15(activate#(XS)) take#(N,XS) -> c_16(fst#(splitAt(N,XS)),splitAt#(N,XS)) Weak DPs and mark the set of starting terms. * Step 3: PredecessorEstimation WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: U11#(tt(),N,X,XS) -> c_1(U12#(splitAt(activate(N),activate(XS)),activate(X)) ,splitAt#(activate(N),activate(XS)) ,activate#(N) ,activate#(XS) ,activate#(X)) U12#(pair(YS,ZS),X) -> c_2(activate#(X))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807