Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902243
details
property
value
status
complete
benchmark
minsort.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
Mixed_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.365104198 seconds
cpu usage
794.46195751
max memory
1.7103474688E10
stage attributes
key
value
output-size
2651
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: del(x,cons(y,z)) -> if(eq(x,y),z,cons(y,del(x,z))) del(x,nil()) -> nil() eq(0(),0()) -> true() eq(0(),s(y)) -> false() eq(s(x),0()) -> false() eq(s(x),s(y)) -> eq(x,y) if(false(),x,y) -> y if(true(),x,y) -> x le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) min(x,cons(y,z)) -> if(le(x,y),min(x,z),min(y,z)) min(x,nil()) -> x minsort(cons(x,y)) -> cons(min(x,y),minsort(del(min(x,y),cons(x,y)))) minsort(nil()) -> nil() - Signature: {del/2,eq/2,if/3,le/2,min/2,minsort/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {del,eq,if,le,min,minsort} and constructors {0,cons,false,nil,s ,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: del(x,cons(y,z)) -> if(eq(x,y),z,cons(y,del(x,z))) del(x,nil()) -> nil() eq(0(),0()) -> true() eq(0(),s(y)) -> false() eq(s(x),0()) -> false() eq(s(x),s(y)) -> eq(x,y) if(false(),x,y) -> y if(true(),x,y) -> x le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) min(x,cons(y,z)) -> if(le(x,y),min(x,z),min(y,z)) min(x,nil()) -> x minsort(cons(x,y)) -> cons(min(x,y),minsort(del(min(x,y),cons(x,y)))) minsort(nil()) -> nil() - Signature: {del/2,eq/2,if/3,le/2,min/2,minsort/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {del,eq,if,le,min,minsort} and constructors {0,cons,false,nil,s ,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: del(x,z){z -> cons(y,z)} = del(x,cons(y,z)) ->^+ if(eq(x,y),z,cons(y,del(x,z))) = C[del(x,z) = del(x,z){}] 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