Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904515
details
property
value
status
complete
benchmark
mod.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
AProVE_09_Inductive
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
271.018082142 seconds
cpu usage
1067.33556592
max memory
2.19871232E9
stage attributes
key
value
output-size
2392
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: gt(0(),y) -> false() gt(s(x),0()) -> true() gt(s(x),s(y)) -> gt(x,y) if(false(),x,y) -> 0() if(true(),x,y) -> s(minus(x,y)) if1(false(),x,y) -> mod(minus(x,y),y) if1(true(),x,y) -> x lt(x,0()) -> false() lt(0(),s(x)) -> true() lt(s(x),s(y)) -> lt(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if(gt(s(x),y),x,y) mod(x,0()) -> 0() mod(x,s(y)) -> if1(lt(x,s(y)),x,s(y)) - Signature: {gt/2,if/3,if1/3,lt/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {gt,if,if1,lt,minus,mod} 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: gt(0(),y) -> false() gt(s(x),0()) -> true() gt(s(x),s(y)) -> gt(x,y) if(false(),x,y) -> 0() if(true(),x,y) -> s(minus(x,y)) if1(false(),x,y) -> mod(minus(x,y),y) if1(true(),x,y) -> x lt(x,0()) -> false() lt(0(),s(x)) -> true() lt(s(x),s(y)) -> lt(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if(gt(s(x),y),x,y) mod(x,0()) -> 0() mod(x,s(y)) -> if1(lt(x,s(y)),x,s(y)) - Signature: {gt/2,if/3,if1/3,lt/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {gt,if,if1,lt,minus,mod} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: gt(x,y){x -> s(x),y -> s(y)} = gt(s(x),s(y)) ->^+ gt(x,y) = C[gt(x,y) = gt(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