Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903440
details
property
value
status
complete
benchmark
Ex4_7_77_Bor03_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0143051147461 seconds
cpu usage
0.019619
max memory
3301376.0
stage attributes
key
value
output-size
5389
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: activate(X) -> X activate(n__zeros()) -> zeros() tail(cons(X,XS)) -> activate(XS) zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {activate/1,tail/1,zeros/0} / {0/0,cons/2,n__zeros/0} - Obligation: runtime complexity wrt. defined symbols {activate,tail,zeros} and constructors {0,cons,n__zeros} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: ToInnermost WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__zeros()) -> zeros() tail(cons(X,XS)) -> activate(XS) zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {activate/1,tail/1,zeros/0} / {0/0,cons/2,n__zeros/0} - Obligation: runtime complexity wrt. defined symbols {activate,tail,zeros} and constructors {0,cons,n__zeros} + 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: activate(X) -> X activate(n__zeros()) -> zeros() tail(cons(X,XS)) -> activate(XS) zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {activate/1,tail/1,zeros/0} / {0/0,cons/2,n__zeros/0} - Obligation: innermost runtime complexity wrt. defined symbols {activate,tail,zeros} and constructors {0,cons,n__zeros} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs activate#(X) -> c_1() activate#(n__zeros()) -> c_2(zeros#()) tail#(cons(X,XS)) -> c_3(activate#(XS)) zeros#() -> c_4() zeros#() -> c_5() Weak DPs and mark the set of starting terms. * Step 4: UsableRules WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: activate#(X) -> c_1() activate#(n__zeros()) -> c_2(zeros#()) tail#(cons(X,XS)) -> c_3(activate#(XS)) zeros#() -> c_4() zeros#() -> c_5() - Weak TRS: activate(X) -> X activate(n__zeros()) -> zeros() tail(cons(X,XS)) -> activate(XS) zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {activate/1,tail/1,zeros/0,activate#/1,tail#/1,zeros#/0} / {0/0,cons/2,n__zeros/0,c_1/0,c_2/1,c_3/1,c_4/0 ,c_5/0} - Obligation: innermost runtime complexity wrt. defined symbols {activate#,tail#,zeros#} and constructors {0,cons ,n__zeros} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: activate#(X) -> c_1() activate#(n__zeros()) -> c_2(zeros#()) tail#(cons(X,XS)) -> c_3(activate#(XS)) zeros#() -> c_4() zeros#() -> c_5() * Step 5: Trivial WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: activate#(X) -> c_1() activate#(n__zeros()) -> c_2(zeros#())
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127