Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902934
details
property
value
status
complete
benchmark
#3.17.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.145999908 seconds
cpu usage
730.372717624
max memory
1.67815168E9
stage attributes
key
value
output-size
1995
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /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: app(l,nil()) -> l app(cons(x,l),k) -> cons(x,app(l,k)) app(nil(),k) -> k plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil())) -> cons(x,nil()) - Signature: {app/2,plus/2,sum/1} / {0/0,cons/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {app,plus,sum} and constructors {0,cons,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: app(l,nil()) -> l app(cons(x,l),k) -> cons(x,app(l,k)) app(nil(),k) -> k plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(cons(x,nil())) -> cons(x,nil()) - Signature: {app/2,plus/2,sum/1} / {0/0,cons/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {app,plus,sum} and constructors {0,cons,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: app(y,z){y -> cons(x,y)} = app(cons(x,y),z) ->^+ cons(x,app(y,z)) = C[app(y,z) = app(y,z){}] 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