Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381902483
details
property
value
status
complete
benchmark
18.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Der95
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.0835781097412 seconds
cpu usage
0.284667128
max memory
1.9349504E7
stage attributes
key
value
output-size
2785
starexec-result
WORST_CASE(Omega(n^1),O(n^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(Omega(n^1),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: *(x,+(y,z)) -> +(*(x,y),*(x,z)) - Signature: {*/2} / {+/2} - Obligation: runtime complexity wrt. defined symbols {*} and constructors {+} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: *(x,+(y,z)) -> +(*(x,y),*(x,z)) - Signature: {*/2} / {+/2} - Obligation: runtime complexity wrt. defined symbols {*} and constructors {+} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: *(x,y){y -> +(y,z)} = *(x,+(y,z)) ->^+ +(*(x,y),*(x,z)) = C[*(x,y) = *(x,y){}] ** Step 1.b:1: NaturalMI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: *(x,+(y,z)) -> +(*(x,y),*(x,z)) - Signature: {*/2} / {+/2} - Obligation: runtime complexity wrt. defined symbols {*} and constructors {+} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(+) = {1,2} Following symbols are considered usable: all TcT has computed the following interpretation: p(*) = [2] x2 + [0] p(+) = [1] x1 + [1] x2 + [8] Following rules are strictly oriented: *(x,+(y,z)) = [2] y + [2] z + [16] > [2] y + [2] z + [8] = +(*(x,y),*(x,z)) Following rules are (at-least) weakly oriented: ** Step 1.b:2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: *(x,+(y,z)) -> +(*(x,y),*(x,z)) - Signature: {*/2} / {+/2} - Obligation: runtime complexity wrt. defined symbols {*} and constructors {+} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(Omega(n^1),O(n^1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127