Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904994
details
property
value
status
complete
benchmark
thiemann22.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
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.969207048 seconds
cpu usage
1155.28653991
max memory
1.020715008E9
stage attributes
key
value
output-size
2201
starexec-result
WORST_CASE(Omega(n^1),?)
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: double(0()) -> 0() double(s(x)) -> s(s(double(x))) if(false(),x,y,z) -> loop(x,double(y),s(z)) if(true(),x,y,z) -> z le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) log(0()) -> logError() log(s(x)) -> loop(s(x),s(0()),0()) loop(x,s(y),z) -> if(le(x,s(y)),x,s(y),z) - Signature: {double/1,if/4,le/2,log/1,loop/3} / {0/0,false/0,logError/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {double,if,le,log,loop} and constructors {0,false,logError ,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: double(0()) -> 0() double(s(x)) -> s(s(double(x))) if(false(),x,y,z) -> loop(x,double(y),s(z)) if(true(),x,y,z) -> z le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) log(0()) -> logError() log(s(x)) -> loop(s(x),s(0()),0()) loop(x,s(y),z) -> if(le(x,s(y)),x,s(y),z) - Signature: {double/1,if/4,le/2,log/1,loop/3} / {0/0,false/0,logError/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {double,if,le,log,loop} and constructors {0,false,logError ,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: double(x){x -> s(x)} = double(s(x)) ->^+ s(s(double(x))) = C[double(x) = double(x){}] 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