Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904805
details
property
value
status
complete
benchmark
MYNAT_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.537902116776 seconds
cpu usage
2.073473185
max memory
3.774464E7
stage attributes
key
value
output-size
17373
starexec-result
WORST_CASE(Omega(n^1),O(n^2))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^2)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^2)) + Considered Problem: - Strict TRS: activate(X) -> X and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) - Signature: {activate/1,and/2,plus/2,x/2} / {0/0,s/1,tt/0} - Obligation: innermost runtime complexity wrt. defined symbols {activate,and,plus,x} and constructors {0,s,tt} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: activate(X) -> X and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) - Signature: {activate/1,and/2,plus/2,x/2} / {0/0,s/1,tt/0} - Obligation: innermost runtime complexity wrt. defined symbols {activate,and,plus,x} and constructors {0,s,tt} + 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^2)) + Considered Problem: - Strict TRS: activate(X) -> X and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) - Signature: {activate/1,and/2,plus/2,x/2} / {0/0,s/1,tt/0} - Obligation: innermost runtime complexity wrt. defined symbols {activate,and,plus,x} and constructors {0,s,tt} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs activate#(X) -> c_1() and#(tt(),X) -> c_2(activate#(X)) plus#(N,0()) -> c_3() plus#(N,s(M)) -> c_4(plus#(N,M)) x#(N,0()) -> c_5() x#(N,s(M)) -> c_6(plus#(x(N,M),N),x#(N,M)) Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: activate#(X) -> c_1() and#(tt(),X) -> c_2(activate#(X)) plus#(N,0()) -> c_3() plus#(N,s(M)) -> c_4(plus#(N,M)) x#(N,0()) -> c_5() x#(N,s(M)) -> c_6(plus#(x(N,M),N),x#(N,M)) - Weak TRS: activate(X) -> X and(tt(),X) -> activate(X) plus(N,0()) -> N plus(N,s(M)) -> s(plus(N,M)) x(N,0()) -> 0() x(N,s(M)) -> plus(x(N,M),N) - Signature: {activate/1,and/2,plus/2,x/2,activate#/1,and#/2,plus#/2,x#/2} / {0/0,s/1,tt/0,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 {activate#,and#,plus#,x#} and constructors {0,s,tt} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1,3,5}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807