Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904443
details
property
value
status
complete
benchmark
cime4.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
Secret_05_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.428495883942 seconds
cpu usage
1.699308753
max memory
3.0298112E7
stage attributes
key
value
output-size
6536
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: f(k(a()),k(b()),X) -> f(X,X,X) g(X) -> u(h(X),h(X),X) h(d()) -> c(a()) h(d()) -> c(b()) u(d(),c(Y),X) -> k(Y) - Signature: {f/3,g/1,h/1,u/3} / {a/0,b/0,c/1,d/0,k/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g,h,u} and constructors {a,b,c,d,k} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: f(k(a()),k(b()),X) -> f(X,X,X) g(X) -> u(h(X),h(X),X) h(d()) -> c(a()) h(d()) -> c(b()) u(d(),c(Y),X) -> k(Y) - Signature: {f/3,g/1,h/1,u/3} / {a/0,b/0,c/1,d/0,k/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g,h,u} and constructors {a,b,c,d,k} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs f#(k(a()),k(b()),X) -> c_1(f#(X,X,X)) g#(X) -> c_2(u#(h(X),h(X),X),h#(X),h#(X)) h#(d()) -> c_3() h#(d()) -> c_4() u#(d(),c(Y),X) -> c_5() Weak DPs and mark the set of starting terms. * Step 3: PredecessorEstimation WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: f#(k(a()),k(b()),X) -> c_1(f#(X,X,X)) g#(X) -> c_2(u#(h(X),h(X),X),h#(X),h#(X)) h#(d()) -> c_3() h#(d()) -> c_4() u#(d(),c(Y),X) -> c_5() - Weak TRS: f(k(a()),k(b()),X) -> f(X,X,X) g(X) -> u(h(X),h(X),X) h(d()) -> c(a()) h(d()) -> c(b()) u(d(),c(Y),X) -> k(Y) - Signature: {f/3,g/1,h/1,u/3,f#/3,g#/1,h#/1,u#/3} / {a/0,b/0,c/1,d/0,k/1,c_1/1,c_2/3,c_3/0,c_4/0,c_5/0} - Obligation: innermost runtime complexity wrt. defined symbols {f#,g#,h#,u#} and constructors {a,b,c,d,k} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1,3,4,5} by application of Pre({1,3,4,5}) = {2}. Here rules are labelled as follows: 1: f#(k(a()),k(b()),X) -> c_1(f#(X,X,X)) 2: g#(X) -> c_2(u#(h(X),h(X),X),h#(X),h#(X)) 3: h#(d()) -> c_3() 4: h#(d()) -> c_4() 5: u#(d(),c(Y),X) -> c_5() * Step 4: PredecessorEstimation WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: g#(X) -> c_2(u#(h(X),h(X),X),h#(X),h#(X)) - Weak DPs: f#(k(a()),k(b()),X) -> c_1(f#(X,X,X)) h#(d()) -> c_3() h#(d()) -> c_4() u#(d(),c(Y),X) -> c_5() - Weak TRS: f(k(a()),k(b()),X) -> f(X,X,X) g(X) -> u(h(X),h(X),X) h(d()) -> c(a()) h(d()) -> c(b()) u(d(),c(Y),X) -> k(Y) - Signature: {f/3,g/1,h/1,u/3,f#/3,g#/1,h#/1,u#/3} / {a/0,b/0,c/1,d/0,k/1,c_1/1,c_2/3,c_3/0,c_4/0,c_5/0} - Obligation: innermost runtime complexity wrt. defined symbols {f#,g#,h#,u#} and constructors {a,b,c,d,k}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807