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