Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Deriv Compl Full Rewri 33144 pair #381922416
details
property
value
status
complete
benchmark
Ex15_Luc06_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_dc
runtime (wallclock)
30.0324690342 seconds
cpu usage
107.239299214
max memory
1.08752896E8
stage attributes
key
value
output-size
13500
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: a() -> n__a() activate(X) -> X activate(n__a()) -> a() activate(n__f(X)) -> f(X) activate(n__g(X)) -> g(activate(X)) f(X) -> n__f(X) f(n__f(n__a())) -> f(n__g(n__f(n__a()))) g(X) -> n__g(X) - Signature: {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1} - Obligation: derivational complexity wrt. signature {a,activate,f,g,n__a,n__f,n__g} + 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(a) = [1] p(activate) = [1] x1 + [2] p(f) = [1] x1 + [2] p(g) = [1] x1 + [0] p(n__a) = [0] p(n__f) = [1] x1 + [1] p(n__g) = [1] x1 + [0] Following rules are strictly oriented: a() = [1] > [0] = n__a() activate(X) = [1] X + [2] > [1] X + [0] = X activate(n__a()) = [2] > [1] = a() activate(n__f(X)) = [1] X + [3] > [1] X + [2] = f(X) f(X) = [1] X + [2] > [1] X + [1] = n__f(X) Following rules are (at-least) weakly oriented: activate(n__g(X)) = [1] X + [2] >= [1] X + [2] = g(activate(X)) f(n__f(n__a())) = [3] >= [3] = f(n__g(n__f(n__a()))) g(X) = [1] X + [0] >= [1] X + [0] = n__g(X) * Step 2: WeightGap WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: activate(n__g(X)) -> g(activate(X)) f(n__f(n__a())) -> f(n__g(n__f(n__a()))) g(X) -> n__g(X) - Weak TRS: a() -> n__a() activate(X) -> X activate(n__a()) -> a() activate(n__f(X)) -> f(X) f(X) -> n__f(X) - Signature: {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1} - Obligation: derivational complexity wrt. signature {a,activate,f,g,n__a,n__f,n__g} + 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) = [5] p(activate) = [1] x1 + [0]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Deriv Compl Full Rewri 33144