Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902159
details
property
value
status
complete
benchmark
10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.586863995 seconds
cpu usage
779.044824993
max memory
4.62886912E9
stage attributes
key
value
output-size
2587
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: +(0(),y) -> y +(s(x),y) -> s(+(x,y)) ++(:(x,xs),ys) -> :(x,++(xs,ys)) ++(nil(),ys) -> ys -(x,0()) -> x -(0(),s(y)) -> 0() -(s(x),s(y)) -> -(x,y) avg(xs) -> quot(hd(sum(xs)),length(xs)) hd(:(x,xs)) -> x length(:(x,xs)) -> s(length(xs)) length(nil()) -> 0() quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(-(x,y),s(y))) sum(++(xs,:(x,:(y,ys)))) -> sum(++(xs,sum(:(x,:(y,ys))))) sum(:(x,:(y,xs))) -> sum(:(+(x,y),xs)) sum(:(x,nil())) -> :(x,nil()) - Signature: {+/2,++/2,-/2,avg/1,hd/1,length/1,quot/2,sum/1} / {0/0,:/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {+,++,-,avg,hd,length,quot,sum} and constructors {0,:,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: +(0(),y) -> y +(s(x),y) -> s(+(x,y)) ++(:(x,xs),ys) -> :(x,++(xs,ys)) ++(nil(),ys) -> ys -(x,0()) -> x -(0(),s(y)) -> 0() -(s(x),s(y)) -> -(x,y) avg(xs) -> quot(hd(sum(xs)),length(xs)) hd(:(x,xs)) -> x length(:(x,xs)) -> s(length(xs)) length(nil()) -> 0() quot(0(),s(y)) -> 0() quot(s(x),s(y)) -> s(quot(-(x,y),s(y))) sum(++(xs,:(x,:(y,ys)))) -> sum(++(xs,sum(:(x,:(y,ys))))) sum(:(x,:(y,xs))) -> sum(:(+(x,y),xs)) sum(:(x,nil())) -> :(x,nil()) - Signature: {+/2,++/2,-/2,avg/1,hd/1,length/1,quot/2,sum/1} / {0/0,:/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {+,++,-,avg,hd,length,quot,sum} and constructors {0,:,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: +(x,y){x -> s(x)} = +(s(x),y) ->^+ s(+(x,y)) = C[+(x,y) = +(x,y){}] WORST_CASE(Omega(n^1),?)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127