Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922153
details
property
value
status
complete
benchmark
koen.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n078.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
0.221539974213 seconds
cpu usage
0.77508126
max memory
2.838528E7
stage attributes
key
value
output-size
3830
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: WeightGap WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(X,X) -> c(X) f(X,c(X)) -> f(s(X),X) f(s(X),X) -> f(X,a(X)) - Signature: {f/2} / {a/1,c/1,s/1} - Obligation: derivational complexity wrt. signature {a,c,f,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(a) = [1] x1 + [0] p(c) = [1] x1 + [0] p(f) = [1] x1 + [1] x2 + [8] p(s) = [1] x1 + [1] Following rules are strictly oriented: f(X,X) = [2] X + [8] > [1] X + [0] = c(X) f(s(X),X) = [2] X + [9] > [2] X + [8] = f(X,a(X)) Following rules are (at-least) weakly oriented: f(X,c(X)) = [2] X + [8] >= [2] X + [9] = f(s(X),X) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 2: WeightGap WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(X,c(X)) -> f(s(X),X) - Weak TRS: f(X,X) -> c(X) f(s(X),X) -> f(X,a(X)) - Signature: {f/2} / {a/1,c/1,s/1} - Obligation: derivational complexity wrt. signature {a,c,f,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(a) = [1] x1 + [4] p(c) = [1] x1 + [5] p(f) = [1] x1 + [1] x2 + [5] p(s) = [1] x1 + [4] Following rules are strictly oriented: f(X,c(X)) = [2] X + [10] > [2] X + [9] = f(s(X),X) Following rules are (at-least) weakly oriented: f(X,X) = [2] X + [5] >= [1] X + [5] = c(X) f(s(X),X) = [2] X + [9] >= [2] X + [9] = f(X,a(X)) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(X,X) -> c(X) f(X,c(X)) -> f(s(X),X) f(s(X),X) -> f(X,a(X)) - Signature: {f/2} / {a/1,c/1,s/1} - Obligation: derivational complexity wrt. signature {a,c,f,s} + Applied Processor: EmptyProcessor
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144