Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904656
details
property
value
status
timeout (cpu)
benchmark
Ex3_3_25_Bor03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
Strategy_removed_CSR_05
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.400848866 seconds
cpu usage
1222.71748667
max memory
3.660754944E9
stage attributes
unavailable
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: app(cons(X,XS),YS) -> cons(X,app(XS,YS)) app(nil(),YS) -> YS from(X) -> cons(X,from(s(X))) prefix(L) -> cons(nil(),zWadr(L,prefix(L))) zWadr(XS,nil()) -> nil() zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,nil())),zWadr(XS,YS)) zWadr(nil(),YS) -> nil() - Signature: {app/2,from/1,prefix/1,zWadr/2} / {cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {cons,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: app(cons(X,XS),YS) -> cons(X,app(XS,YS)) app(nil(),YS) -> YS from(X) -> cons(X,from(s(X))) prefix(L) -> cons(nil(),zWadr(L,prefix(L))) zWadr(XS,nil()) -> nil() zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,nil())),zWadr(XS,YS)) zWadr(nil(),YS) -> nil() - Signature: {app/2,from/1,prefix/1,zWadr/2} / {cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {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 Inner Rewri 22807