Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904077
details
property
value
status
complete
benchmark
10.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
Beerendonk_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
270.951114893 seconds
cpu usage
896.824660302
max memory
2.072723456E9
stage attributes
key
value
output-size
2518
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: cond1(true(),x) -> cond2(even(x),x) cond2(false(),x) -> cond1(neq(x,0()),p(x)) cond2(true(),x) -> cond1(neq(x,0()),div2(x)) div2(0()) -> 0() div2(s(0())) -> 0() div2(s(s(x))) -> s(div2(x)) even(0()) -> true() even(s(0())) -> false() even(s(s(x))) -> even(x) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y())) -> neq(x,y()) p(0()) -> 0() p(s(x)) -> x - Signature: {cond1/2,cond2/2,div2/1,even/1,neq/2,p/1} / {0/0,false/0,s/1,true/0,y/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond1,cond2,div2,even,neq,p} and constructors {0,false,s ,true,y} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond1(true(),x) -> cond2(even(x),x) cond2(false(),x) -> cond1(neq(x,0()),p(x)) cond2(true(),x) -> cond1(neq(x,0()),div2(x)) div2(0()) -> 0() div2(s(0())) -> 0() div2(s(s(x))) -> s(div2(x)) even(0()) -> true() even(s(0())) -> false() even(s(s(x))) -> even(x) neq(0(),0()) -> false() neq(0(),s(x)) -> true() neq(s(x),0()) -> true() neq(s(x),s(y())) -> neq(x,y()) p(0()) -> 0() p(s(x)) -> x - Signature: {cond1/2,cond2/2,div2/1,even/1,neq/2,p/1} / {0/0,false/0,s/1,true/0,y/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond1,cond2,div2,even,neq,p} and constructors {0,false,s ,true,y} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: div2(x){x -> s(s(x))} = div2(s(s(x))) ->^+ s(div2(x)) = C[div2(x) = div2(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