Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905282
details
property
value
status
complete
benchmark
Ex2_Luc03b_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
1.67587018013 seconds
cpu usage
7.744504561
max memory
8.5536768E7
stage attributes
key
value
output-size
4346
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: activate(X) -> X activate(n__add(X1,X2)) -> add(X1,X2) activate(n__from(X)) -> from(X) activate(n__fst(X1,X2)) -> fst(X1,X2) activate(n__len(X)) -> len(X) add(X1,X2) -> n__add(X1,X2) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) fst(X1,X2) -> n__fst(X1,X2) fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) len(X) -> n__len(X) len(cons(X,Z)) -> s(n__len(activate(Z))) len(nil()) -> 0() - Signature: {activate/1,add/2,from/1,fst/2,len/1} / {0/0,cons/2,n__add/2,n__from/1,n__fst/2,n__len/1,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,add,from,fst,len} and constructors {0,cons ,n__add,n__from,n__fst,n__len,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__add(X1,X2)) -> add(X1,X2) activate(n__from(X)) -> from(X) activate(n__fst(X1,X2)) -> fst(X1,X2) activate(n__len(X)) -> len(X) add(X1,X2) -> n__add(X1,X2) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) fst(X1,X2) -> n__fst(X1,X2) fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) len(X) -> n__len(X) len(cons(X,Z)) -> s(n__len(activate(Z))) len(nil()) -> 0() - Signature: {activate/1,add/2,from/1,fst/2,len/1} / {0/0,cons/2,n__add/2,n__from/1,n__fst/2,n__len/1,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,add,from,fst,len} and constructors {0,cons ,n__add,n__from,n__fst,n__len,nil,s} + Applied Processor: Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing} + Details: Signatures used: ---------------- 0 :: [] -(0)-> "A"(6) 0 :: [] -(0)-> "A"(8) activate :: ["A"(6)] -(5)-> "A"(0) add :: ["A"(6) x "A"(0)] -(8)-> "A"(0) cons :: ["A"(0) x "A"(6)] -(6)-> "A"(6) cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0) from :: ["A"(0)] -(8)-> "A"(0) fst :: ["A"(6) x "A"(6)] -(5)-> "A"(0) len :: ["A"(6)] -(4)-> "A"(0) n__add :: ["A"(6) x "A"(0)] -(6)-> "A"(6) n__add :: ["A"(4) x "A"(0)] -(4)-> "A"(4) n__add :: ["A"(0) x "A"(0)] -(0)-> "A"(0) n__from :: ["A"(0)] -(6)-> "A"(6) n__from :: ["A"(0)] -(1)-> "A"(1) n__from :: ["A"(0)] -(0)-> "A"(0) n__fst :: ["A"(6) x "A"(6)] -(6)-> "A"(6) n__fst :: ["A"(0) x "A"(0)] -(0)-> "A"(0) n__len :: ["A"(6)] -(6)-> "A"(6) n__len :: ["A"(0)] -(0)-> "A"(0) nil :: [] -(0)-> "A"(6) nil :: [] -(0)-> "A"(8) s :: ["A"(6)] -(6)-> "A"(6) s :: ["A"(0)] -(0)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "0_A" :: [] -(0)-> "A"(1) "cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1) "n__add_A" :: ["A"(0) x "A"(0)] -(1)-> "A"(1) "n__from_A" :: ["A"(0)] -(1)-> "A"(1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807