Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903123
details
property
value
status
complete
benchmark
thiemann16.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.206996918 seconds
cpu usage
898.316441938
max memory
3.558854656E9
stage attributes
key
value
output-size
2764
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /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: check(0()) -> zero() check(s(0())) -> odd() check(s(s(0()))) -> even() check(s(s(s(x)))) -> check(s(x)) half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) if(even(),x,y,z,u) -> plus(timesIter(half(x),y,half(z)),timesIter(half(x),y,half(s(z)))) if(odd(),x,y,z,u) -> timesIter(p(x),y,u) if(zero(),x,y,z,u) -> z p(0()) -> 0() p(s(x)) -> x plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) times(x,y) -> timesIter(x,y,0()) timesIter(x,y,z) -> if(check(x),x,y,z,plus(z,y)) - Signature: {check/1,half/1,if/5,p/1,plus/2,times/2,timesIter/3} / {0/0,even/0,odd/0,s/1,zero/0} - Obligation: runtime complexity wrt. defined symbols {check,half,if,p,plus,times,timesIter} and constructors {0,even,odd ,s,zero} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: check(0()) -> zero() check(s(0())) -> odd() check(s(s(0()))) -> even() check(s(s(s(x)))) -> check(s(x)) half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) if(even(),x,y,z,u) -> plus(timesIter(half(x),y,half(z)),timesIter(half(x),y,half(s(z)))) if(odd(),x,y,z,u) -> timesIter(p(x),y,u) if(zero(),x,y,z,u) -> z p(0()) -> 0() p(s(x)) -> x plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) times(x,y) -> timesIter(x,y,0()) timesIter(x,y,z) -> if(check(x),x,y,z,plus(z,y)) - Signature: {check/1,half/1,if/5,p/1,plus/2,times/2,timesIter/3} / {0/0,even/0,odd/0,s/1,zero/0} - Obligation: runtime complexity wrt. defined symbols {check,half,if,p,plus,times,timesIter} and constructors {0,even,odd ,s,zero} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: check(s(x)){x -> s(s(x))} = check(s(s(s(x)))) ->^+ check(s(x)) = C[check(s(x)) = check(s(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 Full Rewri 10127