/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: a__f(X) -> f(X) a__f(f(a())) -> a__f(g(f(a()))) mark(a()) -> a() mark(f(X)) -> a__f(X) mark(g(X)) -> g(mark(X)) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: derivational complexity wrt. signature {a,a__f,f,g,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(a) = [15] p(a__f) = [1] x1 + [1] p(f) = [1] x1 + [1] p(g) = [1] x1 + [0] p(mark) = [1] x1 + [12] Following rules are strictly oriented: mark(a()) = [27] > [15] = a() mark(f(X)) = [1] X + [13] > [1] X + [1] = a__f(X) Following rules are (at-least) weakly oriented: a__f(X) = [1] X + [1] >= [1] X + [1] = f(X) a__f(f(a())) = [17] >= [17] = a__f(g(f(a()))) mark(g(X)) = [1] X + [12] >= [1] X + [12] = g(mark(X)) * Step 2: WeightGap. WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: a__f(X) -> f(X) a__f(f(a())) -> a__f(g(f(a()))) mark(g(X)) -> g(mark(X)) - Weak TRS: mark(a()) -> a() mark(f(X)) -> a__f(X) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: derivational complexity wrt. signature {a,a__f,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) = [0] p(a__f) = [1] x1 + [5] p(f) = [1] x1 + [0] p(g) = [1] x1 + [0] p(mark) = [1] x1 + [5] Following rules are strictly oriented: a__f(X) = [1] X + [5] > [1] X + [0] = f(X) Following rules are (at-least) weakly oriented: a__f(f(a())) = [5] >= [5] = a__f(g(f(a()))) mark(a()) = [5] >= [0] = a() mark(f(X)) = [1] X + [5] >= [1] X + [5] = a__f(X) mark(g(X)) = [1] X + [5] >= [1] X + [5] = g(mark(X)) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 3: NaturalMI. WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: a__f(f(a())) -> a__f(g(f(a()))) mark(g(X)) -> g(mark(X)) - Weak TRS: a__f(X) -> f(X) mark(a()) -> a() mark(f(X)) -> a__f(X) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: derivational complexity wrt. signature {a,a__f,f,g,mark} + Applied Processor: NaturalMI {miDimension = 2, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind triangular matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima): Following symbols are considered usable: all TcT has computed the following interpretation: p(a) = [4] [2] p(a__f) = [1 6] x1 + [2] [0 0] [4] p(f) = [1 6] x1 + [0] [0 0] [2] p(g) = [1 0] x1 + [3] [0 0] [0] p(mark) = [1 0] x1 + [2] [0 0] [8] Following rules are strictly oriented: a__f(f(a())) = [30] [4] > [21] [4] = a__f(g(f(a()))) Following rules are (at-least) weakly oriented: a__f(X) = [1 6] X + [2] [0 0] [4] >= [1 6] X + [0] [0 0] [2] = f(X) mark(a()) = [6] [8] >= [4] [2] = a() mark(f(X)) = [1 6] X + [2] [0 0] [8] >= [1 6] X + [2] [0 0] [4] = a__f(X) mark(g(X)) = [1 0] X + [5] [0 0] [8] >= [1 0] X + [5] [0 0] [0] = g(mark(X)) * Step 4: NaturalMI. WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: mark(g(X)) -> g(mark(X)) - Weak TRS: a__f(X) -> f(X) a__f(f(a())) -> a__f(g(f(a()))) mark(a()) -> a() mark(f(X)) -> a__f(X) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: derivational complexity wrt. signature {a,a__f,f,g,mark} + 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(a) = [5] [0] p(a__f) = [1 0] x1 + [0] [0 0] [0] p(f) = [1 0] x1 + [0] [0 0] [0] p(g) = [1 0] x1 + [0] [0 1] [1] p(mark) = [1 1] x1 + [8] [0 1] [0] Following rules are strictly oriented: mark(g(X)) = [1 1] X + [9] [0 1] [1] > [1 1] X + [8] [0 1] [1] = g(mark(X)) Following rules are (at-least) weakly oriented: a__f(X) = [1 0] X + [0] [0 0] [0] >= [1 0] X + [0] [0 0] [0] = f(X) a__f(f(a())) = [5] [0] >= [5] [0] = a__f(g(f(a()))) mark(a()) = [13] [0] >= [5] [0] = a() mark(f(X)) = [1 0] X + [8] [0 0] [0] >= [1 0] X + [0] [0 0] [0] = a__f(X) * Step 5: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: a__f(X) -> f(X) a__f(f(a())) -> a__f(g(f(a()))) mark(a()) -> a() mark(f(X)) -> a__f(X) mark(g(X)) -> g(mark(X)) - Signature: {a__f/1,mark/1} / {a/0,f/1,g/1} - Obligation: derivational complexity wrt. signature {a,a__f,f,g,mark} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^2))