Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922074
details
property
value
status
complete
benchmark
#4.28.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
30.0272920132 seconds
cpu usage
80.954409663
max memory
9.1512832E7
stage attributes
key
value
output-size
7367
starexec-result
WORST_CASE(?,O(n^2))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^2)) * Step 1: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: bits(0()) -> 0() bits(s(x)) -> s(bits(half(s(x)))) half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) - Signature: {bits/1,half/1} / {0/0,s/1} - Obligation: derivational complexity wrt. signature {0,bits,half,s} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind triangular matrix interpretation: Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [1] p(bits) = [1] x1 + [2] p(half) = [1] x1 + [0] p(s) = [1] x1 + [0] Following rules are strictly oriented: bits(0()) = [3] > [1] = 0() Following rules are (at-least) weakly oriented: bits(s(x)) = [1] x + [2] >= [1] x + [2] = s(bits(half(s(x)))) half(0()) = [1] >= [1] = 0() half(s(0())) = [1] >= [1] = 0() half(s(s(x))) = [1] x + [0] >= [1] x + [0] = s(half(x)) * Step 2: WeightGap WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: bits(s(x)) -> s(bits(half(s(x)))) half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) - Weak TRS: bits(0()) -> 0() - Signature: {bits/1,half/1} / {0/0,s/1} - Obligation: derivational complexity wrt. signature {0,bits,half,s} + Applied Processor: WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = NoUArgs, wgOn = WgOnAny} + Details: The weightgap principle applies using the following nonconstant growth matrix-interpretation: We apply a matrix interpretation of kind triangular matrix interpretation: Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [0] p(bits) = [1] x1 + [0] p(half) = [1] x1 + [13] p(s) = [1] x1 + [1] Following rules are strictly oriented: half(0()) = [13] > [0] = 0() half(s(0())) = [14] > [0] = 0() half(s(s(x))) = [1] x + [15] > [1] x + [14] = s(half(x)) Following rules are (at-least) weakly oriented: bits(0()) = [0] >= [0] = 0()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144