Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902818
details
property
value
status
complete
benchmark
kabasci05.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
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.293487787 seconds
cpu usage
796.925299958
max memory
3.780550656E9
stage attributes
key
value
output-size
2626
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /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: cons(x,y) -> y cons(x,cons(y,s(z))) -> cons(y,x) cons(cons(x,z),s(y)) -> transform(x) gcd(s(x),s(y)) -> gcd(minus(max(x,y),min(x,transform(y))),s(min(x,y))) max(x,0()) -> x max(0(),y) -> y max(s(x),s(y)) -> s(max(x,y)) min(x,0()) -> 0() min(0(),y) -> 0() min(s(x),s(y)) -> s(min(x,y)) minus(x,0()) -> x minus(s(x),s(y)) -> s(minus(x,y)) transform(x) -> s(s(x)) transform(cons(x,y)) -> y transform(cons(x,y)) -> cons(cons(x,x),x) transform(s(x)) -> s(s(transform(x))) - Signature: {cons/2,gcd/2,max/2,min/2,minus/2,transform/1} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {cons,gcd,max,min,minus,transform} and constructors {0,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cons(x,y) -> y cons(x,cons(y,s(z))) -> cons(y,x) cons(cons(x,z),s(y)) -> transform(x) gcd(s(x),s(y)) -> gcd(minus(max(x,y),min(x,transform(y))),s(min(x,y))) max(x,0()) -> x max(0(),y) -> y max(s(x),s(y)) -> s(max(x,y)) min(x,0()) -> 0() min(0(),y) -> 0() min(s(x),s(y)) -> s(min(x,y)) minus(x,0()) -> x minus(s(x),s(y)) -> s(minus(x,y)) transform(x) -> s(s(x)) transform(cons(x,y)) -> y transform(cons(x,y)) -> cons(cons(x,x),x) transform(s(x)) -> s(s(transform(x))) - Signature: {cons/2,gcd/2,max/2,min/2,minus/2,transform/1} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {cons,gcd,max,min,minus,transform} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: max(x,y){x -> s(x),y -> s(y)} = max(s(x),s(y)) ->^+ s(max(x,y)) = C[max(x,y) = max(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 Full Rewri 10127