Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902380
details
property
value
status
complete
benchmark
parting01_reverse.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
AProVE_08
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.528203964 seconds
cpu usage
865.986118741
max memory
3.658678272E9
stage attributes
key
value
output-size
2508
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: del(x,cons(y,xs)) -> if(eq(x,y),x,y,xs) 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,xs) -> cons(y,del(x,xs)) if(true(),x,y,xs) -> xs last(cons(x,cons(y,xs))) -> last(cons(y,xs)) last(cons(x,nil())) -> x last(nil()) -> 0() reverse(cons(x,xs)) -> cons(last(cons(x,xs)),reverse(del(last(cons(x,xs)),cons(x,xs)))) reverse(nil()) -> nil() - Signature: {del/2,eq/2,if/4,last/1,reverse/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {del,eq,if,last,reverse} 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,xs)) -> if(eq(x,y),x,y,xs) 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,xs) -> cons(y,del(x,xs)) if(true(),x,y,xs) -> xs last(cons(x,cons(y,xs))) -> last(cons(y,xs)) last(cons(x,nil())) -> x last(nil()) -> 0() reverse(cons(x,xs)) -> cons(last(cons(x,xs)),reverse(del(last(cons(x,xs)),cons(x,xs)))) reverse(nil()) -> nil() - Signature: {del/2,eq/2,if/4,last/1,reverse/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {del,eq,if,last,reverse} 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){}] 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