Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903078
details
property
value
status
complete
benchmark
2.37.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.113027095795 seconds
cpu usage
0.388712286
max memory
2.3666688E7
stage attributes
key
value
output-size
3843
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: and(not(not(x)),y,not(z)) -> and(y,band(x,z),x) - Signature: {and/3} / {band/2,not/1} - Obligation: runtime complexity wrt. defined symbols {and} and constructors {band,not} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: and(not(not(x)),y,not(z)) -> and(y,band(x,z),x) - Signature: {and/3} / {band/2,not/1} - Obligation: runtime complexity wrt. defined symbols {and} and constructors {band,not} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following weak dependency pairs: Strict DPs and#(not(not(x)),y,not(z)) -> c_1(and#(y,band(x,z),x)) Weak DPs and mark the set of starting terms. * Step 3: UsableRules WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: and#(not(not(x)),y,not(z)) -> c_1(and#(y,band(x,z),x)) - Strict TRS: and(not(not(x)),y,not(z)) -> and(y,band(x,z),x) - Signature: {and/3,and#/3} / {band/2,not/1,c_1/1} - Obligation: runtime complexity wrt. defined symbols {and#} and constructors {band,not} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: and#(not(not(x)),y,not(z)) -> c_1(and#(y,band(x,z),x)) * Step 4: NaturalMI WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: and#(not(not(x)),y,not(z)) -> c_1(and#(y,band(x,z),x)) - Signature: {and/3,and#/3} / {band/2,not/1,c_1/1} - Obligation: runtime complexity wrt. defined symbols {and#} and constructors {band,not} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 0, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation (containing no more than 0 non-zero interpretation-entries in the diagonal of the component-wise maxima): The following argument positions are considered usable: uargs(c_1) = {1} Following symbols are considered usable: all TcT has computed the following interpretation: p(and) = [1] x1 + [1] x2 + [1] p(band) = [0] p(not) = [1] p(and#) = [1] x1 + [4] x2 + [0] p(c_1) = [4] x1 + [0] Following rules are strictly oriented: and#(not(not(x)),y,not(z)) = [4] y + [1] > [4] y + [0] = c_1(and#(y,band(x,z),x)) Following rules are (at-least) weakly oriented: * Step 5: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: and#(not(not(x)),y,not(z)) -> c_1(and#(y,band(x,z),x)) - Signature: {and/3,and#/3} / {band/2,not/1,c_1/1} - Obligation: runtime complexity wrt. defined symbols {and#} and constructors {band,not} + 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 Full Rewri 10127