Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905212
details
property
value
status
complete
benchmark
Ex4_Zan97_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.266321182 seconds
cpu usage
1164.85403345
max memory
2.7214848E9
stage attributes
key
value
output-size
2084
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /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: activate(X) -> X activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(activate(X)) f(X) -> cons(X,n__f(n__g(X))) f(X) -> n__f(X) g(X) -> n__g(X) g(0()) -> s(0()) g(s(X)) -> s(s(g(X))) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,f/1,g/1,sel/2} / {0/0,cons/2,n__f/1,n__g/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,f,g,sel} and constructors {0,cons,n__f,n__g,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(activate(X)) f(X) -> cons(X,n__f(n__g(X))) f(X) -> n__f(X) g(X) -> n__g(X) g(0()) -> s(0()) g(s(X)) -> s(s(g(X))) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,f/1,g/1,sel/2} / {0/0,cons/2,n__f/1,n__g/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,f,g,sel} and constructors {0,cons,n__f,n__g,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(x){x -> n__f(x)} = activate(n__f(x)) ->^+ f(activate(x)) = C[activate(x) = activate(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