Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904753
details
property
value
status
complete
benchmark
9.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n028.star.cs.uiowa.edu
space
Beerendonk_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.042121887 seconds
cpu usage
915.33058816
max memory
2.184491008E9
stage attributes
key
value
output-size
2049
starexec-result
WORST_CASE(Omega(n^1),?)
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: and(x,false()) -> false() and(false(),x) -> false() and(true(),true()) -> true() cond(true(),x,y,z) -> cond(and(gr(x,z),gr(y,z)),p(x),p(y),z) gr(0(),x) -> false() gr(0(),0()) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x - Signature: {and/2,cond/4,gr/2,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {and,cond,gr,p} and constructors {0,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: and(x,false()) -> false() and(false(),x) -> false() and(true(),true()) -> true() cond(true(),x,y,z) -> cond(and(gr(x,z),gr(y,z)),p(x),p(y),z) gr(0(),x) -> false() gr(0(),0()) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x - Signature: {and/2,cond/4,gr/2,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {and,cond,gr,p} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: gr(x,y){x -> s(x),y -> s(y)} = gr(s(x),s(y)) ->^+ gr(x,y) = C[gr(x,y) = gr(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