Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904482
details
property
value
status
complete
benchmark
logarquot.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
6.31628394127 seconds
cpu usage
17.169083251
max memory
1.17026816E8
stage attributes
key
value
output-size
25937
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: log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) - Signature: {log/1,min/2,quot/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {log,min,quot} 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: log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) - Signature: {log/1,min/2,quot/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {log,min,quot} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: min(x,y){x -> s(x),y -> s(y)} = min(s(x),s(y)) ->^+ min(x,y) = C[min(x,y) = min(x,y){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) - Signature: {log/1,min/2,quot/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {log,min,quot} and constructors {0,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs log#(s(0())) -> c_1() log#(s(s(X))) -> c_2(log#(s(quot(X,s(s(0()))))),quot#(X,s(s(0())))) min#(X,0()) -> c_3() min#(s(X),s(Y)) -> c_4(min#(X,Y)) quot#(0(),s(Y)) -> c_5() quot#(s(X),s(Y)) -> c_6(quot#(min(X,Y),s(Y)),min#(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: log#(s(0())) -> c_1() log#(s(s(X))) -> c_2(log#(s(quot(X,s(s(0()))))),quot#(X,s(s(0())))) min#(X,0()) -> c_3() min#(s(X),s(Y)) -> c_4(min#(X,Y)) quot#(0(),s(Y)) -> c_5() quot#(s(X),s(Y)) -> c_6(quot#(min(X,Y),s(Y)),min#(X,Y)) - Weak TRS: log(s(0())) -> 0() log(s(s(X))) -> s(log(s(quot(X,s(s(0())))))) min(X,0()) -> X min(s(X),s(Y)) -> min(X,Y) quot(0(),s(Y)) -> 0() quot(s(X),s(Y)) -> s(quot(min(X,Y),s(Y))) - Signature: {log/1,min/2,quot/2,log#/1,min#/2,quot#/2} / {0/0,s/1,c_1/0,c_2/2,c_3/0,c_4/1,c_5/0,c_6/2} - Obligation: innermost runtime complexity wrt. defined symbols {log#,min#,quot#} 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