Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904151
details
property
value
status
complete
benchmark
#4.36.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
7.86817193031 seconds
cpu usage
34.017127977
max memory
1.59834112E8
stage attributes
key
value
output-size
99865
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: eq(0(),0()) -> true() eq(0(),s(m)) -> false() eq(s(n),0()) -> false() eq(s(n),s(m)) -> eq(n,m) if_min(false(),cons(n,cons(m,x))) -> min(cons(m,x)) if_min(true(),cons(n,cons(m,x))) -> min(cons(n,x)) if_replace(false(),n,m,cons(k,x)) -> cons(k,replace(n,m,x)) if_replace(true(),n,m,cons(k,x)) -> cons(m,x) le(0(),m) -> true() le(s(n),0()) -> false() le(s(n),s(m)) -> le(n,m) min(cons(n,cons(m,x))) -> if_min(le(n,m),cons(n,cons(m,x))) min(cons(0(),nil())) -> 0() min(cons(s(n),nil())) -> s(n) replace(n,m,cons(k,x)) -> if_replace(eq(n,k),n,m,cons(k,x)) replace(n,m,nil()) -> nil() sort(cons(n,x)) -> cons(min(cons(n,x)),sort(replace(min(cons(n,x)),n,x))) sort(nil()) -> nil() - Signature: {eq/2,if_min/2,if_replace/4,le/2,min/1,replace/3,sort/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {eq,if_min,if_replace,le,min,replace ,sort} and constructors {0,cons,false,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: eq(0(),0()) -> true() eq(0(),s(m)) -> false() eq(s(n),0()) -> false() eq(s(n),s(m)) -> eq(n,m) if_min(false(),cons(n,cons(m,x))) -> min(cons(m,x)) if_min(true(),cons(n,cons(m,x))) -> min(cons(n,x)) if_replace(false(),n,m,cons(k,x)) -> cons(k,replace(n,m,x)) if_replace(true(),n,m,cons(k,x)) -> cons(m,x) le(0(),m) -> true() le(s(n),0()) -> false() le(s(n),s(m)) -> le(n,m) min(cons(n,cons(m,x))) -> if_min(le(n,m),cons(n,cons(m,x))) min(cons(0(),nil())) -> 0() min(cons(s(n),nil())) -> s(n) replace(n,m,cons(k,x)) -> if_replace(eq(n,k),n,m,cons(k,x)) replace(n,m,nil()) -> nil() sort(cons(n,x)) -> cons(min(cons(n,x)),sort(replace(min(cons(n,x)),n,x))) sort(nil()) -> nil() - Signature: {eq/2,if_min/2,if_replace/4,le/2,min/1,replace/3,sort/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {eq,if_min,if_replace,le,min,replace ,sort} and constructors {0,cons,false,nil,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: eq(x,y){x -> s(x),y -> s(y)} = eq(s(x),s(y)) ->^+ eq(x,y) = C[eq(x,y) = eq(x,y){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: eq(0(),0()) -> true() eq(0(),s(m)) -> false() eq(s(n),0()) -> false() eq(s(n),s(m)) -> eq(n,m) if_min(false(),cons(n,cons(m,x))) -> min(cons(m,x)) if_min(true(),cons(n,cons(m,x))) -> min(cons(n,x)) if_replace(false(),n,m,cons(k,x)) -> cons(k,replace(n,m,x)) if_replace(true(),n,m,cons(k,x)) -> cons(m,x) le(0(),m) -> true() le(s(n),0()) -> false() le(s(n),s(m)) -> le(n,m) min(cons(n,cons(m,x))) -> if_min(le(n,m),cons(n,cons(m,x))) min(cons(0(),nil())) -> 0() min(cons(s(n),nil())) -> s(n) replace(n,m,cons(k,x)) -> if_replace(eq(n,k),n,m,cons(k,x)) replace(n,m,nil()) -> nil() sort(cons(n,x)) -> cons(min(cons(n,x)),sort(replace(min(cons(n,x)),n,x))) sort(nil()) -> nil() - Signature: {eq/2,if_min/2,if_replace/4,le/2,min/1,replace/3,sort/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {eq,if_min,if_replace,le,min,replace ,sort} and constructors {0,cons,false,nil,s,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807