Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905222
details
property
value
status
complete
benchmark
Ex1_2_Luc02c_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.217694044 seconds
cpu usage
1067.07247839
max memory
4.46466048E9
stage attributes
key
value
output-size
1998
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__2nd(X) -> 2nd(X) a__2nd(cons(X,cons(Y,Z))) -> mark(Y) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) mark(2nd(X)) -> a__2nd(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(s(X)) -> s(mark(X)) - Signature: {a__2nd/1,a__from/1,mark/1} / {2nd/1,cons/2,from/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__2nd,a__from,mark} and constructors {2nd,cons,from,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__2nd(X) -> 2nd(X) a__2nd(cons(X,cons(Y,Z))) -> mark(Y) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) mark(2nd(X)) -> a__2nd(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(s(X)) -> s(mark(X)) - Signature: {a__2nd/1,a__from/1,mark/1} / {2nd/1,cons/2,from/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__2nd,a__from,mark} and constructors {2nd,cons,from,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> 2nd(x)} = mark(2nd(x)) ->^+ a__2nd(mark(x)) = 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