Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903900
details
property
value
status
complete
benchmark
Ex2_Luc03b_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0155689716339 seconds
cpu usage
0.020886524
max memory
3432448.0
stage attributes
key
value
output-size
5540
starexec-result
WORST_CASE(?,O(1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) * Step 1: Sum WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: add(0(),X) -> X add(s(),Y) -> s() from(X) -> cons(X) fst(0(),Z) -> nil() fst(s(),cons(Y)) -> cons(Y) len(cons(X)) -> s() len(nil()) -> 0() - Signature: {add/2,from/1,fst/2,len/1} / {0/0,cons/1,nil/0,s/0} - Obligation: runtime complexity wrt. defined symbols {add,from,fst,len} and constructors {0,cons,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: ToInnermost WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: add(0(),X) -> X add(s(),Y) -> s() from(X) -> cons(X) fst(0(),Z) -> nil() fst(s(),cons(Y)) -> cons(Y) len(cons(X)) -> s() len(nil()) -> 0() - Signature: {add/2,from/1,fst/2,len/1} / {0/0,cons/1,nil/0,s/0} - Obligation: runtime complexity wrt. defined symbols {add,from,fst,len} and constructors {0,cons,nil,s} + 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: add(0(),X) -> X add(s(),Y) -> s() from(X) -> cons(X) fst(0(),Z) -> nil() fst(s(),cons(Y)) -> cons(Y) len(cons(X)) -> s() len(nil()) -> 0() - Signature: {add/2,from/1,fst/2,len/1} / {0/0,cons/1,nil/0,s/0} - Obligation: innermost runtime complexity wrt. defined symbols {add,from,fst,len} and constructors {0,cons,nil,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs add#(0(),X) -> c_1() add#(s(),Y) -> c_2() from#(X) -> c_3() fst#(0(),Z) -> c_4() fst#(s(),cons(Y)) -> c_5() len#(cons(X)) -> c_6() len#(nil()) -> c_7() Weak DPs and mark the set of starting terms. * Step 4: UsableRules WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: add#(0(),X) -> c_1() add#(s(),Y) -> c_2() from#(X) -> c_3() fst#(0(),Z) -> c_4() fst#(s(),cons(Y)) -> c_5() len#(cons(X)) -> c_6() len#(nil()) -> c_7() - Weak TRS: add(0(),X) -> X add(s(),Y) -> s() from(X) -> cons(X) fst(0(),Z) -> nil() fst(s(),cons(Y)) -> cons(Y) len(cons(X)) -> s() len(nil()) -> 0() - Signature: {add/2,from/1,fst/2,len/1,add#/2,from#/1,fst#/2,len#/1} / {0/0,cons/1,nil/0,s/0,c_1/0,c_2/0,c_3/0,c_4/0 ,c_5/0,c_6/0,c_7/0} - Obligation: innermost runtime complexity wrt. defined symbols {add#,from#,fst#,len#} and constructors {0,cons,nil,s} + 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