Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922750
details
property
value
status
complete
benchmark
Ex23_Luc06_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
30.1427891254 seconds
cpu usage
89.985957623
max memory
2.6535936E8
stage attributes
key
value
output-size
21126
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: active(f(f(a()))) -> mark(c(f(g(f(a()))))) c(active(X)) -> c(X) c(mark(X)) -> c(X) f(active(X)) -> f(X) f(mark(X)) -> f(X) g(active(X)) -> g(X) g(mark(X)) -> g(X) mark(a()) -> active(a()) mark(c(X)) -> active(c(X)) mark(f(X)) -> active(f(mark(X))) mark(g(X)) -> active(g(mark(X))) - Signature: {active/1,c/1,f/1,g/1,mark/1} / {a/0} - Obligation: derivational complexity wrt. signature {a,active,c,f,g,mark} + 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] p(active) = [1] x1 + [1] p(c) = [1] x1 + [0] p(f) = [1] x1 + [8] p(g) = [1] x1 + [0] p(mark) = [1] x1 + [0] Following rules are strictly oriented: active(f(f(a()))) = [18] > [17] = mark(c(f(g(f(a()))))) c(active(X)) = [1] X + [1] > [1] X + [0] = c(X) f(active(X)) = [1] X + [9] > [1] X + [8] = f(X) g(active(X)) = [1] X + [1] > [1] X + [0] = g(X) Following rules are (at-least) weakly oriented: c(mark(X)) = [1] X + [0] >= [1] X + [0] = c(X) f(mark(X)) = [1] X + [8] >= [1] X + [8] = f(X) g(mark(X)) = [1] X + [0] >= [1] X + [0] = g(X) mark(a()) = [1] >= [2] = active(a()) mark(c(X)) = [1] X + [0] >= [1] X + [1] = active(c(X)) mark(f(X)) = [1] X + [8] >= [1] X + [9] = active(f(mark(X))) mark(g(X)) = [1] X + [0] >= [1] X + [1] = active(g(mark(X))) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 2: WeightGap WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: c(mark(X)) -> c(X) f(mark(X)) -> f(X) g(mark(X)) -> g(X) mark(a()) -> active(a()) mark(c(X)) -> active(c(X)) mark(f(X)) -> active(f(mark(X))) mark(g(X)) -> active(g(mark(X))) - Weak TRS:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144