Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904240
details
property
value
status
complete
benchmark
#3.53.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
6.94688510895 seconds
cpu usage
34.671368413
max memory
1.60591872E8
stage attributes
key
value
output-size
89749
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: app(add(n,x),y) -> add(n,app(x,y)) app(nil(),y) -> y concat(cons(u,v),y) -> cons(u,concat(v,y)) concat(leaf(),y) -> y less_leaves(x,leaf()) -> false() less_leaves(cons(u,v),cons(w,z)) -> less_leaves(concat(u,v),concat(w,z)) less_leaves(leaf(),cons(w,z)) -> true() minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(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,concat/2,less_leaves/2,minus/2,quot/2,reverse/1,shuffle/1} / {0/0,add/2,cons/2,false/0,leaf/0,nil/0 ,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,concat,less_leaves,minus,quot,reverse ,shuffle} and constructors {0,add,cons,false,leaf,nil,s,true} + 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 concat(cons(u,v),y) -> cons(u,concat(v,y)) concat(leaf(),y) -> y less_leaves(x,leaf()) -> false() less_leaves(cons(u,v),cons(w,z)) -> less_leaves(concat(u,v),concat(w,z)) less_leaves(leaf(),cons(w,z)) -> true() minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(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,concat/2,less_leaves/2,minus/2,quot/2,reverse/1,shuffle/1} / {0/0,add/2,cons/2,false/0,leaf/0,nil/0 ,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,concat,less_leaves,minus,quot,reverse ,shuffle} and constructors {0,add,cons,false,leaf,nil,s,true} + 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 concat(cons(u,v),y) -> cons(u,concat(v,y)) concat(leaf(),y) -> y less_leaves(x,leaf()) -> false() less_leaves(cons(u,v),cons(w,z)) -> less_leaves(concat(u,v),concat(w,z)) less_leaves(leaf(),cons(w,z)) -> true() minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(minus(x,y),s(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,concat/2,less_leaves/2,minus/2,quot/2,reverse/1,shuffle/1} / {0/0,add/2,cons/2,false/0,leaf/0,nil/0 ,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,concat,less_leaves,minus,quot,reverse ,shuffle} and constructors {0,add,cons,false,leaf,nil,s,true} + 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() concat#(cons(u,v),y) -> c_3(concat#(v,y))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807