Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905166
details
property
value
status
complete
benchmark
ExProp7_Luc06_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.57119011879 seconds
cpu usage
2.176921998
max memory
3.6589568E7
stage attributes
key
value
output-size
2953
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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(X)) -> X - 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: Bounds 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(X)) -> X - 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: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. 0_0() -> 1 0_0() -> 2 0_1() -> 1 0_1() -> 2 0_1() -> 3 0_1() -> 6 0_2() -> 7 0_2() -> 10 activate_0(2) -> 1 cons_0(2,2) -> 1 cons_0(2,2) -> 2 cons_1(3,4) -> 1 cons_2(7,8) -> 1 f_0(2) -> 1 f_1(2) -> 1 n__f_0(2) -> 1 n__f_0(2) -> 2 n__f_1(2) -> 1 n__f_1(5) -> 4 n__f_2(2) -> 1 n__f_2(9) -> 8 p_0(2) -> 1 p_1(5) -> 1 p_1(5) -> 2 s_0(2) -> 1 s_0(2) -> 2 s_1(6) -> 5 s_2(10) -> 9 2 -> 1 6 -> 1 6 -> 2 * Step 3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak 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(X)) -> X - 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: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(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