Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904262
details
property
value
status
timeout (cpu)
benchmark
tpa09.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
Secret_06_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
295.236035824 seconds
cpu usage
1539.46705893
max memory
3.8195216384E10
stage attributes
unavailable
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),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: *(x,0()) -> 0() *(x,s(y)) -> +(x,*(x,y)) +(0(),y) -> y +(s(x),y) -> s(+(x,y)) -(x,0()) -> x -(s(x),s(y)) -> -(x,y) f(s(x)) -> f(-(max(*(s(x),s(x)),+(s(x),s(s(s(0()))))),max(s(*(s(x),s(x))),+(s(x),s(s(s(s(0())))))))) max(x,0()) -> x max(0(),y) -> y max(s(x),s(y)) -> s(max(x,y)) min(x,0()) -> 0() min(0(),y) -> 0() min(s(x),s(y)) -> s(min(x,y)) - Signature: {*/2,+/2,-/2,f/1,max/2,min/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {*,+,-,f,max,min} and constructors {0,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: *(x,0()) -> 0() *(x,s(y)) -> +(x,*(x,y)) +(0(),y) -> y +(s(x),y) -> s(+(x,y)) -(x,0()) -> x -(s(x),s(y)) -> -(x,y) f(s(x)) -> f(-(max(*(s(x),s(x)),+(s(x),s(s(s(0()))))),max(s(*(s(x),s(x))),+(s(x),s(s(s(s(0())))))))) max(x,0()) -> x max(0(),y) -> y max(s(x),s(y)) -> s(max(x,y)) min(x,0()) -> 0() min(0(),y) -> 0() min(s(x),s(y)) -> s(min(x,y)) - Signature: {*/2,+/2,-/2,f/1,max/2,min/2} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {*,+,-,f,max,min} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: *(x,y){y -> s(y)} = *(x,s(y)) ->^+ +(x,*(x,y)) = C[*(x,y) = *(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 Inner Rewri 22807