Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904835
details
property
value
status
complete
benchmark
Ex7_BLR02_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
1.28045701981 seconds
cpu usage
5.491347009
max memory
7.0144E7
stage attributes
key
value
output-size
3723
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: 2nd(cons(X,XS)) -> head(activate(XS)) activate(X) -> X activate(n__from(X)) -> from(X) activate(n__take(X1,X2)) -> take(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) head(cons(X,XS)) -> X sel(0(),cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,activate(XS)) take(X1,X2) -> n__take(X1,X2) take(0(),XS) -> nil() take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS))) - Signature: {2nd/1,activate/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,n__from/1,n__take/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {2nd,activate,from,head,sel,take} and constructors {0,cons ,n__from,n__take,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 2nd(cons(X,XS)) -> head(activate(XS)) activate(X) -> X activate(n__from(X)) -> from(X) activate(n__take(X1,X2)) -> take(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) head(cons(X,XS)) -> X sel(0(),cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,activate(XS)) take(X1,X2) -> n__take(X1,X2) take(0(),XS) -> nil() take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS))) - Signature: {2nd/1,activate/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,n__from/1,n__take/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {2nd,activate,from,head,sel,take} and constructors {0,cons ,n__from,n__take,nil,s} + Applied Processor: Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing} + Details: Signatures used: ---------------- 0 :: [] -(0)-> "A"(8) 0 :: [] -(0)-> "A"(5) 2nd :: ["A"(13)] -(10)-> "A"(0) activate :: ["A"(5)] -(8)-> "A"(5) cons :: ["A"(0) x "A"(13)] -(13)-> "A"(13) cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0) cons :: ["A"(0) x "A"(5)] -(5)-> "A"(5) from :: ["A"(0)] -(6)-> "A"(5) head :: ["A"(0)] -(5)-> "A"(0) n__from :: ["A"(0)] -(0)-> "A"(5) n__from :: ["A"(0)] -(0)-> "A"(15) n__from :: ["A"(0)] -(0)-> "A"(7) n__take :: ["A"(5) x "A"(5)] -(5)-> "A"(5) nil :: [] -(0)-> "A"(14) s :: ["A"(8)] -(8)-> "A"(8) s :: ["A"(5)] -(5)-> "A"(5) s :: ["A"(0)] -(0)-> "A"(0) sel :: ["A"(8) x "A"(5)] -(7)-> "A"(0) take :: ["A"(5) x "A"(5)] -(12)-> "A"(5) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "0_A" :: [] -(0)-> "A"(1) "cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1) "n__from_A" :: ["A"(0)] -(0)-> "A"(1) "n__take_A" :: ["A"(0) x "A"(0)] -(1)-> "A"(1) "nil_A" :: [] -(0)-> "A"(1) "s_A" :: ["A"(1)] -(1)-> "A"(1) WORST_CASE(?,O(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