Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904783
details
property
value
status
complete
benchmark
#3.16.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
8.75653100014 seconds
cpu usage
48.078959603
max memory
4.12913664E8
stage attributes
key
value
output-size
37901
starexec-result
WORST_CASE(Omega(n^1),O(n^3))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^3)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^3)) + Considered Problem: - Strict TRS: plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) plus(0(),x) -> x plus(s(x),y) -> s(plus(x,y)) times(x,0()) -> 0() times(x,s(y)) -> plus(times(x,y),x) - Signature: {plus/2,times/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {plus,times} and constructors {0,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) plus(0(),x) -> x plus(s(x),y) -> s(plus(x,y)) times(x,0()) -> 0() times(x,s(y)) -> plus(times(x,y),x) - Signature: {plus/2,times/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {plus,times} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: plus(x,y){y -> s(y)} = plus(x,s(y)) ->^+ s(plus(x,y)) = C[plus(x,y) = plus(x,y){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) plus(0(),x) -> x plus(s(x),y) -> s(plus(x,y)) times(x,0()) -> 0() times(x,s(y)) -> plus(times(x,y),x) - Signature: {plus/2,times/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {plus,times} and constructors {0,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs plus#(x,0()) -> c_1() plus#(x,s(y)) -> c_2(plus#(x,y)) plus#(0(),x) -> c_3() plus#(s(x),y) -> c_4(plus#(x,y)) times#(x,0()) -> c_5() times#(x,s(y)) -> c_6(plus#(times(x,y),x),times#(x,y)) Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: plus#(x,0()) -> c_1() plus#(x,s(y)) -> c_2(plus#(x,y)) plus#(0(),x) -> c_3() plus#(s(x),y) -> c_4(plus#(x,y)) times#(x,0()) -> c_5() times#(x,s(y)) -> c_6(plus#(times(x,y),x),times#(x,y)) - Weak TRS: plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) plus(0(),x) -> x plus(s(x),y) -> s(plus(x,y)) times(x,0()) -> 0() times(x,s(y)) -> plus(times(x,y),x) - Signature: {plus/2,times/2,plus#/2,times#/2} / {0/0,s/1,c_1/0,c_2/1,c_3/0,c_4/1,c_5/0,c_6/2} - Obligation: innermost runtime complexity wrt. defined symbols {plus#,times#} and constructors {0,s} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1,3,5} by application of
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807