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