Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904344
details
property
value
status
complete
benchmark
32.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
Der95
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
5.40319395065 seconds
cpu usage
28.35775719
max memory
2.46136832E8
stage attributes
key
value
output-size
35210
starexec-result
WORST_CASE(Omega(n^1),O(n^2))
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^2)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^2)) + Considered Problem: - Strict TRS: choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) insert(x,nil()) -> cons(x,nil()) sort(cons(x,y)) -> insert(x,sort(y)) sort(nil()) -> nil() - Signature: {choose/4,insert/2,sort/1} / {0/0,cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {choose,insert,sort} and constructors {0,cons,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) insert(x,nil()) -> cons(x,nil()) sort(cons(x,y)) -> insert(x,sort(y)) sort(nil()) -> nil() - Signature: {choose/4,insert/2,sort/1} / {0/0,cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {choose,insert,sort} and constructors {0,cons,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: choose(x,cons(y,z),u,v){u -> s(u),v -> s(v)} = choose(x,cons(y,z),s(u),s(v)) ->^+ choose(x,cons(y,z),u,v) = C[choose(x,cons(y,z),u,v) = choose(x,cons(y,z),u,v){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) insert(x,nil()) -> cons(x,nil()) sort(cons(x,y)) -> insert(x,sort(y)) sort(nil()) -> nil() - Signature: {choose/4,insert/2,sort/1} / {0/0,cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {choose,insert,sort} and constructors {0,cons,nil,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs choose#(x,cons(v,w),y,0()) -> c_1() choose#(x,cons(v,w),0(),s(z)) -> c_2(insert#(x,w)) choose#(x,cons(v,w),s(y),s(z)) -> c_3(choose#(x,cons(v,w),y,z)) insert#(x,cons(v,w)) -> c_4(choose#(x,cons(v,w),x,v)) insert#(x,nil()) -> c_5() sort#(cons(x,y)) -> c_6(insert#(x,sort(y)),sort#(y)) sort#(nil()) -> c_7() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^2)) + Considered Problem: - Strict DPs: choose#(x,cons(v,w),y,0()) -> c_1() choose#(x,cons(v,w),0(),s(z)) -> c_2(insert#(x,w)) choose#(x,cons(v,w),s(y),s(z)) -> c_3(choose#(x,cons(v,w),y,z)) insert#(x,cons(v,w)) -> c_4(choose#(x,cons(v,w),x,v)) insert#(x,nil()) -> c_5() sort#(cons(x,y)) -> c_6(insert#(x,sort(y)),sort#(y)) sort#(nil()) -> c_7() - Weak TRS: choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) insert(x,nil()) -> cons(x,nil()) sort(cons(x,y)) -> insert(x,sort(y)) sort(nil()) -> nil() - Signature: {choose/4,insert/2,sort/1,choose#/4,insert#/2,sort#/1} / {0/0,cons/2,nil/0,s/1,c_1/0,c_2/1,c_3/1,c_4/1,c_5/0 ,c_6/2,c_7/0} - Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807