Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905158
details
property
value
status
complete
benchmark
Ex6_9_Luc02c_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.113290071487 seconds
cpu usage
0.317258764
max memory
1.8546688E7
stage attributes
key
value
output-size
9611
starexec-result
WORST_CASE(?,O(1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /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: 2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1))) 2nd(cons1(X,cons(Y,Z))) -> Y activate(X) -> X activate(n__from(X)) -> from(X) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) - Signature: {2nd/1,activate/1,from/1} / {cons/2,cons1/2,n__from/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {2nd,activate,from} and constructors {cons,cons1,n__from ,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: 2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1))) 2nd(cons1(X,cons(Y,Z))) -> Y activate(X) -> X activate(n__from(X)) -> from(X) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) - Signature: {2nd/1,activate/1,from/1} / {cons/2,cons1/2,n__from/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {2nd,activate,from} and constructors {cons,cons1,n__from ,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs 2nd#(cons(X,X1)) -> c_1(2nd#(cons1(X,activate(X1))),activate#(X1)) 2nd#(cons1(X,cons(Y,Z))) -> c_2() activate#(X) -> c_3() activate#(n__from(X)) -> c_4(from#(X)) from#(X) -> c_5() from#(X) -> c_6() Weak DPs and mark the set of starting terms. * Step 3: PredecessorEstimation WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: 2nd#(cons(X,X1)) -> c_1(2nd#(cons1(X,activate(X1))),activate#(X1)) 2nd#(cons1(X,cons(Y,Z))) -> c_2() activate#(X) -> c_3() activate#(n__from(X)) -> c_4(from#(X)) from#(X) -> c_5() from#(X) -> c_6() - Weak TRS: 2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1))) 2nd(cons1(X,cons(Y,Z))) -> Y activate(X) -> X activate(n__from(X)) -> from(X) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) - Signature: {2nd/1,activate/1,from/1,2nd#/1,activate#/1,from#/1} / {cons/2,cons1/2,n__from/1,s/1,c_1/2,c_2/0,c_3/0,c_4/1 ,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {2nd#,activate#,from#} and constructors {cons,cons1 ,n__from,s} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {2,3,5,6} by application of Pre({2,3,5,6}) = {1,4}. Here rules are labelled as follows: 1: 2nd#(cons(X,X1)) -> c_1(2nd#(cons1(X,activate(X1))),activate#(X1)) 2: 2nd#(cons1(X,cons(Y,Z))) -> c_2() 3: activate#(X) -> c_3() 4: activate#(n__from(X)) -> c_4(from#(X)) 5: from#(X) -> c_5() 6: from#(X) -> c_6() * Step 4: PredecessorEstimation WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: 2nd#(cons(X,X1)) -> c_1(2nd#(cons1(X,activate(X1))),activate#(X1)) activate#(n__from(X)) -> c_4(from#(X)) - Weak DPs: 2nd#(cons1(X,cons(Y,Z))) -> c_2() activate#(X) -> c_3() from#(X) -> c_5()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807