Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904657
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.231103182 seconds
cpu usage
810.658752662
max memory
1.131978752E9
stage attributes
key
value
output-size
2696
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /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__and(X1,X2) -> and(X1,X2) a__and(tt(),X) -> mark(X) a__length(X) -> length(X) a__length(cons(N,L)) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__zeros() -> cons(0(),zeros()) a__zeros() -> zeros() mark(0()) -> 0() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) mark(tt()) -> tt() mark(zeros()) -> a__zeros() - Signature: {a__and/2,a__length/1,a__zeros/0,mark/1} / {0/0,and/2,cons/2,length/1,nil/0,s/1,tt/0,zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {a__and,a__length,a__zeros,mark} and constructors {0,and ,cons,length,nil,s,tt,zeros} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__and(X1,X2) -> and(X1,X2) a__and(tt(),X) -> mark(X) a__length(X) -> length(X) a__length(cons(N,L)) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__zeros() -> cons(0(),zeros()) a__zeros() -> zeros() mark(0()) -> 0() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) mark(tt()) -> tt() mark(zeros()) -> a__zeros() - Signature: {a__and/2,a__length/1,a__zeros/0,mark/1} / {0/0,and/2,cons/2,length/1,nil/0,s/1,tt/0,zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {a__and,a__length,a__zeros,mark} and constructors {0,and ,cons,length,nil,s,tt,zeros} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> and(x,y)} = mark(and(x,y)) ->^+ a__and(mark(x),y) = C[mark(x) = mark(x){}] 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