Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904757
details
property
value
status
complete
benchmark
Ex4_7_15_Bor03_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.205722093582 seconds
cpu usage
0.768064335
max memory
1.9607552E7
stage attributes
key
value
output-size
2375
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__f(X)) -> f(X) f(X) -> n__f(X) f(0()) -> cons(0(),n__f(s(0()))) f(s(0())) -> f(p(s(0()))) p(s(0())) -> 0() - Signature: {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,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__f(X)) -> f(X) f(X) -> n__f(X) f(0()) -> cons(0(),n__f(s(0()))) f(s(0())) -> f(p(s(0()))) p(s(0())) -> 0() - Signature: {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,s} + Applied Processor: Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing} + Details: Signatures used: ---------------- 0 :: [] -(0)-> "A"(2) 0 :: [] -(0)-> "A"(0) activate :: ["A"(2)] -(1)-> "A"(0) cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0) f :: ["A"(2)] -(1)-> "A"(0) n__f :: ["A"(2)] -(2)-> "A"(2) n__f :: ["A"(0)] -(0)-> "A"(0) p :: ["A"(0)] -(1)-> "A"(2) s :: ["A"(2)] -(2)-> "A"(2) s :: ["A"(0)] -(0)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "0_A" :: [] -(0)-> "A"(0) "cons_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0) "n__f_A" :: ["A"(0)] -(0)-> "A"(0) "s_A" :: ["A"(0)] -(0)-> "A"(0) 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