Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922517
details
property
value
status
complete
benchmark
Ex25_Luc06_iGM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
117.040320873 seconds
cpu usage
192.983782876
max memory
6.49424896E8
stage attributes
key
value
output-size
37245
starexec-result
WORST_CASE(?,O(n^2))
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^2)) * Step 1: NaturalMI WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: active(c(X)) -> mark(d(X)) active(f(f(X))) -> mark(c(f(g(f(X))))) active(h(X)) -> mark(c(d(X))) c(active(X)) -> c(X) c(mark(X)) -> c(X) d(active(X)) -> d(X) d(mark(X)) -> d(X) f(active(X)) -> f(X) f(mark(X)) -> f(X) g(active(X)) -> g(X) g(mark(X)) -> g(X) h(active(X)) -> h(X) h(mark(X)) -> h(X) mark(c(X)) -> active(c(X)) mark(d(X)) -> active(d(X)) mark(f(X)) -> active(f(mark(X))) mark(g(X)) -> active(g(X)) mark(h(X)) -> active(h(mark(X))) - Signature: {active/1,c/1,d/1,f/1,g/1,h/1,mark/1} / {} - Obligation: derivational complexity wrt. signature {active,c,d,f,g,h,mark} + 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(active) = [1] x1 + [0] p(c) = [1] x1 + [0] p(d) = [1] x1 + [0] p(f) = [1] x1 + [64] p(g) = [1] x1 + [0] p(h) = [1] x1 + [145] p(mark) = [1] x1 + [0] Following rules are strictly oriented: active(h(X)) = [1] X + [145] > [1] X + [0] = mark(c(d(X))) Following rules are (at-least) weakly oriented: active(c(X)) = [1] X + [0] >= [1] X + [0] = mark(d(X)) active(f(f(X))) = [1] X + [128] >= [1] X + [128] = mark(c(f(g(f(X))))) c(active(X)) = [1] X + [0] >= [1] X + [0] = c(X) c(mark(X)) = [1] X + [0] >= [1] X + [0] = c(X) d(active(X)) = [1] X + [0] >= [1] X + [0] = d(X) d(mark(X)) = [1] X + [0] >= [1] X + [0] = d(X) f(active(X)) = [1] X + [64] >= [1] X + [64] = f(X) f(mark(X)) = [1] X + [64] >= [1] X + [64] = f(X) g(active(X)) = [1] X + [0] >= [1] X + [0] = g(X) g(mark(X)) = [1] X + [0] >= [1] X + [0] = g(X) h(active(X)) = [1] X + [145] >= [1] X + [145] = h(X) h(mark(X)) = [1] X + [145]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144