Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904546
details
property
value
status
complete
benchmark
#3.12.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
4.50818920135 seconds
cpu usage
23.071149072
max memory
1.2130304E8
stage attributes
key
value
output-size
27458
starexec-result
WORST_CASE(Omega(n^1),O(n^3))
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^3)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^3)) + Considered Problem: - Strict TRS: app(add(n,x),y) -> add(n,app(x,y)) app(nil(),y) -> y reverse(add(n,x)) -> app(reverse(x),add(n,nil())) reverse(nil()) -> nil() shuffle(add(n,x)) -> add(n,shuffle(reverse(x))) shuffle(nil()) -> nil() - Signature: {app/2,reverse/1,shuffle/1} / {add/2,nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,reverse,shuffle} and constructors {add,nil} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: app(add(n,x),y) -> add(n,app(x,y)) app(nil(),y) -> y reverse(add(n,x)) -> app(reverse(x),add(n,nil())) reverse(nil()) -> nil() shuffle(add(n,x)) -> add(n,shuffle(reverse(x))) shuffle(nil()) -> nil() - Signature: {app/2,reverse/1,shuffle/1} / {add/2,nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,reverse,shuffle} and constructors {add,nil} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: app(y,z){y -> add(x,y)} = app(add(x,y),z) ->^+ add(x,app(y,z)) = C[app(y,z) = app(y,z){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: app(add(n,x),y) -> add(n,app(x,y)) app(nil(),y) -> y reverse(add(n,x)) -> app(reverse(x),add(n,nil())) reverse(nil()) -> nil() shuffle(add(n,x)) -> add(n,shuffle(reverse(x))) shuffle(nil()) -> nil() - Signature: {app/2,reverse/1,shuffle/1} / {add/2,nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,reverse,shuffle} and constructors {add,nil} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs app#(add(n,x),y) -> c_1(app#(x,y)) app#(nil(),y) -> c_2() reverse#(add(n,x)) -> c_3(app#(reverse(x),add(n,nil())),reverse#(x)) reverse#(nil()) -> c_4() shuffle#(add(n,x)) -> c_5(shuffle#(reverse(x)),reverse#(x)) shuffle#(nil()) -> c_6() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs: app#(add(n,x),y) -> c_1(app#(x,y)) app#(nil(),y) -> c_2() reverse#(add(n,x)) -> c_3(app#(reverse(x),add(n,nil())),reverse#(x)) reverse#(nil()) -> c_4() shuffle#(add(n,x)) -> c_5(shuffle#(reverse(x)),reverse#(x)) shuffle#(nil()) -> c_6() - Weak TRS: app(add(n,x),y) -> add(n,app(x,y)) app(nil(),y) -> y reverse(add(n,x)) -> app(reverse(x),add(n,nil())) reverse(nil()) -> nil() shuffle(add(n,x)) -> add(n,shuffle(reverse(x))) shuffle(nil()) -> nil() - Signature: {app/2,reverse/1,shuffle/1,app#/2,reverse#/1,shuffle#/1} / {add/2,nil/0,c_1/1,c_2/0,c_3/2,c_4/0,c_5/2,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {app#,reverse#,shuffle#} and constructors {add,nil} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {2,4,6} 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