Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903312
details
property
value
status
complete
benchmark
Ex3_3_25_Bor03_L.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
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0158848762512 seconds
cpu usage
0.020417191
max memory
4087808.0
stage attributes
key
value
output-size
5994
starexec-result
WORST_CASE(?,O(1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) * Step 1: Sum WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: app(cons(X),YS) -> cons(X) app(nil(),YS) -> YS from(X) -> cons(X) prefix(L) -> cons(nil()) zWadr(XS,nil()) -> nil() zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X))) zWadr(nil(),YS) -> nil() - Signature: {app/2,from/1,prefix/1,zWadr/2} / {cons/1,nil/0} - Obligation: runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {cons,nil} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: ToInnermost WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: app(cons(X),YS) -> cons(X) app(nil(),YS) -> YS from(X) -> cons(X) prefix(L) -> cons(nil()) zWadr(XS,nil()) -> nil() zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X))) zWadr(nil(),YS) -> nil() - Signature: {app/2,from/1,prefix/1,zWadr/2} / {cons/1,nil/0} - Obligation: runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {cons,nil} + Applied Processor: ToInnermost + Details: switch to innermost, as the system is overlay and right linear and does not contain weak rules * Step 3: DependencyPairs WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: app(cons(X),YS) -> cons(X) app(nil(),YS) -> YS from(X) -> cons(X) prefix(L) -> cons(nil()) zWadr(XS,nil()) -> nil() zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X))) zWadr(nil(),YS) -> nil() - Signature: {app/2,from/1,prefix/1,zWadr/2} / {cons/1,nil/0} - Obligation: innermost runtime complexity wrt. defined symbols {app,from,prefix,zWadr} and constructors {cons,nil} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs app#(cons(X),YS) -> c_1() app#(nil(),YS) -> c_2() from#(X) -> c_3() prefix#(L) -> c_4() zWadr#(XS,nil()) -> c_5() zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X))) zWadr#(nil(),YS) -> c_7() Weak DPs and mark the set of starting terms. * Step 4: UsableRules WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: app#(cons(X),YS) -> c_1() app#(nil(),YS) -> c_2() from#(X) -> c_3() prefix#(L) -> c_4() zWadr#(XS,nil()) -> c_5() zWadr#(cons(X),cons(Y)) -> c_6(app#(Y,cons(X))) zWadr#(nil(),YS) -> c_7() - Weak TRS: app(cons(X),YS) -> cons(X) app(nil(),YS) -> YS from(X) -> cons(X) prefix(L) -> cons(nil()) zWadr(XS,nil()) -> nil() zWadr(cons(X),cons(Y)) -> cons(app(Y,cons(X))) zWadr(nil(),YS) -> nil() - Signature: {app/2,from/1,prefix/1,zWadr/2,app#/2,from#/1,prefix#/1,zWadr#/2} / {cons/1,nil/0,c_1/0,c_2/0,c_3/0,c_4/0 ,c_5/0,c_6/1,c_7/0} - Obligation: innermost runtime complexity wrt. defined symbols {app#,from#,prefix#,zWadr#} and constructors {cons,nil} + Applied Processor: UsableRules + Details:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127