Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902958
details
property
value
status
complete
benchmark
4.47.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
SK90
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0161299705505 seconds
cpu usage
0.020761369
max memory
3702784.0
stage attributes
key
value
output-size
4847
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: f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'())) f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'())) - Signature: {f/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {.,a,b,b',c,d,d',e,g,h,i,if} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: ToInnermost WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'())) f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'())) - Signature: {f/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {.,a,b,b',c,d,d',e,g,h,i,if} + 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: f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'())) f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'())) - Signature: {f/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {.,a,b,b',c,d,d',e,g,h,i,if} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'())) f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'())) Weak DPs and mark the set of starting terms. * Step 4: UsableRules WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'())) f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'())) - Weak TRS: f(g(h(a(),b()),c()),d()) -> if(e(),f(.(b(),g(h(a(),b()),c())),d()),f(c(),d'())) f(g(i(a(),b(),b'()),c()),d()) -> if(e(),f(.(b(),c()),d'()),f(.(b'(),c()),d'())) - Signature: {f/2,f#/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3,c_1/2,c_2/2} - Obligation: innermost runtime complexity wrt. defined symbols {f#} and constructors {.,a,b,b',c,d,d',e,g,h,i,if} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'())) f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'())) * Step 5: Trivial WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'())) f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'())) - Signature: {f/2,f#/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3,c_1/2,c_2/2} - Obligation: innermost runtime complexity wrt. defined symbols {f#} and constructors {.,a,b,b',c,d,d',e,g,h,i,if} + Applied Processor: Trivial + Details: Consider the dependency graph 1:S:f#(g(h(a(),b()),c()),d()) -> c_1(f#(.(b(),g(h(a(),b()),c())),d()),f#(c(),d'())) 2:S:f#(g(i(a(),b(),b'()),c()),d()) -> c_2(f#(.(b(),c()),d'()),f#(.(b'(),c()),d'())) The dependency graph contains no loops, we remove all dependency pairs. * Step 6: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Signature: {f/2,f#/2} / {./2,a/0,b/0,b'/0,c/0,d/0,d'/0,e/0,g/2,h/2,i/3,if/3,c_1/2,c_2/2} - Obligation: innermost runtime complexity wrt. defined symbols {f#} and constructors {.,a,b,b',c,d,d',e,g,h,i,if} + Applied Processor:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127