details

property	value
status	complete
benchmark	parting03_minsort.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	AProVE_08

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.308887005 seconds
cpu usage	807.142288735
max memory	1.6930988032E10

stage attributes

key	value
output-size	2836
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,z)) -> if2(eq(x,y),x,y,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) if1(false(),x,y,xs) -> min(y,xs) if1(true(),x,y,xs) -> min(x,xs) if2(false(),x,y,xs) -> cons(y,del(x,xs)) if2(true(),x,y,xs) -> xs le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) min(x,cons(y,z)) -> if1(le(x,y),x,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,if1/4,if2/4,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,if1,if2,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)) -> if2(eq(x,y),x,y,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) if1(false(),x,y,xs) -> min(y,xs) if1(true(),x,y,xs) -> min(x,xs) if2(false(),x,y,xs) -> cons(y,del(x,xs)) if2(true(),x,y,xs) -> xs le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) min(x,cons(y,z)) -> if1(le(x,y),x,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,if1/4,if2/4,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,if1,if2,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: 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