Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904832
details
property
value
status
timeout (wallclock)
benchmark
thiemann38.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.362921 seconds
cpu usage
1192.90539359
max memory
4.959133696E9
stage attributes
unavailable
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /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: head(cons(x,l)) -> x head(nil()) -> undefined() if(false(),x,l,accu,orig) -> accu if(true(),x,l,accu,orig) -> rev(s(x),tail(l),cons(head(l),accu),orig) length(cons(x,l)) -> s(length(l)) length(nil()) -> 0() lt(x,0()) -> false() lt(0(),s(y)) -> true() lt(s(x),s(y)) -> lt(x,y) rev(x,l,accu,orig) -> if(lt(x,length(orig)),x,l,accu,orig) reverse(l) -> rev(0(),l,nil(),l) tail(cons(x,l)) -> l tail(nil()) -> nil() - Signature: {head/1,if/5,length/1,lt/2,rev/4,reverse/1,tail/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0,undefined/0} - Obligation: innermost runtime complexity wrt. defined symbols {head,if,length,lt,rev,reverse,tail} and constructors {0 ,cons,false,nil,s,true,undefined} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: head(cons(x,l)) -> x head(nil()) -> undefined() if(false(),x,l,accu,orig) -> accu if(true(),x,l,accu,orig) -> rev(s(x),tail(l),cons(head(l),accu),orig) length(cons(x,l)) -> s(length(l)) length(nil()) -> 0() lt(x,0()) -> false() lt(0(),s(y)) -> true() lt(s(x),s(y)) -> lt(x,y) rev(x,l,accu,orig) -> if(lt(x,length(orig)),x,l,accu,orig) reverse(l) -> rev(0(),l,nil(),l) tail(cons(x,l)) -> l tail(nil()) -> nil() - Signature: {head/1,if/5,length/1,lt/2,rev/4,reverse/1,tail/1} / {0/0,cons/2,false/0,nil/0,s/1,true/0,undefined/0} - Obligation: innermost runtime complexity wrt. defined symbols {head,if,length,lt,rev,reverse,tail} and constructors {0 ,cons,false,nil,s,true,undefined} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: length(y){y -> cons(x,y)} = length(cons(x,y)) ->^+ s(length(y)) = C[length(y) = length(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 Inner Rewri 22807