Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922525
details
property
value
status
complete
benchmark
4.08.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
30.1629750729 seconds
cpu usage
77.91429893
max memory
6.03521024E8
stage attributes
key
value
output-size
3354
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: WeightGap WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: *(x,x) -> x *(x,*(y,z)) -> *(*(x,y),z) - Signature: {*/2} / {} - Obligation: derivational complexity wrt. signature {*} + 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(*) = [1] x1 + [1] x2 + [1] Following rules are strictly oriented: *(x,x) = [2] x + [1] > [1] x + [0] = x Following rules are (at-least) weakly oriented: *(x,*(y,z)) = [1] x + [1] y + [1] z + [2] >= [1] x + [1] y + [1] z + [2] = *(*(x,y),z) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 2: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: *(x,*(y,z)) -> *(*(x,y),z) - Weak TRS: *(x,x) -> x - Signature: {*/2} / {} - Obligation: derivational complexity wrt. signature {*} + Applied Processor: NaturalMI {miDimension = 2, miDegree = 2, 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(*) = [1 0] x1 + [1 15] x2 + [4] [0 1] [0 1] [1] Following rules are strictly oriented: *(x,*(y,z)) = [1 0] x + [1 15] y + [1 30] z + [23] [0 1] [0 1] [0 1] [2] > [1 0] x + [1 15] y + [1 15] z + [8] [0 1] [0 1] [0 1] [2] = *(*(x,y),z) Following rules are (at-least) weakly oriented: *(x,x) = [2 15] x + [4] [0 2] [1] >= [1 0] x + [0] [0 1] [0] = x * Step 3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: *(x,x) -> x *(x,*(y,z)) -> *(*(x,y),z) - Signature: {*/2} / {} - Obligation: derivational complexity wrt. signature {*} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144