Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904621
details
property
value
status
complete
benchmark
mfp95.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n029.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.0621960163116 seconds
cpu usage
0.194458958
max memory
1.0768384E7
stage attributes
key
value
output-size
3093
starexec-result
WORST_CASE(?,O(1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /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: f(s(X),Y) -> h(s(f(h(Y),X))) - Signature: {f/2} / {h/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {h,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: f(s(X),Y) -> h(s(f(h(Y),X))) - Signature: {f/2} / {h/1,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {h,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs f#(s(X),Y) -> c_1(f#(h(Y),X)) Weak DPs and mark the set of starting terms. * Step 3: PredecessorEstimation WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: f#(s(X),Y) -> c_1(f#(h(Y),X)) - Weak TRS: f(s(X),Y) -> h(s(f(h(Y),X))) - Signature: {f/2,f#/2} / {h/1,s/1,c_1/1} - Obligation: innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {1} by application of Pre({1}) = {}. Here rules are labelled as follows: 1: f#(s(X),Y) -> c_1(f#(h(Y),X)) * Step 4: RemoveWeakSuffixes WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: f#(s(X),Y) -> c_1(f#(h(Y),X)) - Weak TRS: f(s(X),Y) -> h(s(f(h(Y),X))) - Signature: {f/2,f#/2} / {h/1,s/1,c_1/1} - Obligation: innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:W:f#(s(X),Y) -> c_1(f#(h(Y),X)) The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 1: f#(s(X),Y) -> c_1(f#(h(Y),X)) * Step 5: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(s(X),Y) -> h(s(f(h(Y),X))) - Signature: {f/2,f#/2} / {h/1,s/1,c_1/1} - Obligation: innermost runtime complexity wrt. defined symbols {f#} and constructors {h,s} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807