/export/starexec/sandbox2/solver/bin/starexec_run_tct_dci /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: 2(6(x1)) -> 4(3(x1)) 3(1(x1)) -> 4(1(x1)) 3(5(x1)) -> 8(9(7(x1))) 3(8(x1)) -> 3(2(7(x1))) 3(9(x1)) -> 9(3(x1)) 5(9(x1)) -> 2(6(5(x1))) 7(1(x1)) -> 6(9(x1)) 7(5(x1)) -> 1(0(x1)) 8(4(x1)) -> 6(x1) 8(8(4(x1))) -> 1(9(x1)) 9(x1) -> 3(2(3(x1))) 9(x1) -> 5(0(2(x1))) - Signature: {2/1,3/1,5/1,7/1,8/1,9/1} / {0/1,1/1,4/1,6/1} - Obligation: innermost derivational complexity wrt. signature {0,1,2,3,4,5,6,7,8,9} + 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(0) = [1] x1 + [0] p(1) = [1] x1 + [0] p(2) = [1] x1 + [1] p(3) = [1] x1 + [5] p(4) = [1] x1 + [0] p(5) = [1] x1 + [1] p(6) = [1] x1 + [0] p(7) = [1] x1 + [0] p(8) = [1] x1 + [0] p(9) = [1] x1 + [11] Following rules are strictly oriented: 3(1(x1)) = [1] x1 + [5] > [1] x1 + [0] = 4(1(x1)) 5(9(x1)) = [1] x1 + [12] > [1] x1 + [2] = 2(6(5(x1))) 7(5(x1)) = [1] x1 + [1] > [1] x1 + [0] = 1(0(x1)) 9(x1) = [1] x1 + [11] > [1] x1 + [2] = 5(0(2(x1))) Following rules are (at-least) weakly oriented: 2(6(x1)) = [1] x1 + [1] >= [1] x1 + [5] = 4(3(x1)) 3(5(x1)) = [1] x1 + [6] >= [1] x1 + [11] = 8(9(7(x1))) 3(8(x1)) = [1] x1 + [5] >= [1] x1 + [6] = 3(2(7(x1))) 3(9(x1)) = [1] x1 + [16] >= [1] x1 + [16] = 9(3(x1)) 7(1(x1)) = [1] x1 + [0] >= [1] x1 + [11] = 6(9(x1)) 8(4(x1)) = [1] x1 + [0] >= [1] x1 + [0] = 6(x1) 8(8(4(x1))) = [1] x1 + [0] >= [1] x1 + [11] = 1(9(x1)) 9(x1) = [1] x1 + [11] >= [1] x1 + [11] = 3(2(3(x1))) 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: 2(6(x1)) -> 4(3(x1)) 3(5(x1)) -> 8(9(7(x1))) 3(8(x1)) -> 3(2(7(x1))) 3(9(x1)) -> 9(3(x1)) 7(1(x1)) -> 6(9(x1)) 8(4(x1)) -> 6(x1) 8(8(4(x1))) -> 1(9(x1)) 9(x1) -> 3(2(3(x1))) - Weak TRS: 3(1(x1)) -> 4(1(x1)) 5(9(x1)) -> 2(6(5(x1))) 7(5(x1)) -> 1(0(x1)) 9(x1) -> 5(0(2(x1))) - Signature: {2/1,3/1,5/1,7/1,8/1,9/1} / {0/1,1/1,4/1,6/1} - Obligation: innermost derivational complexity wrt. signature {0,1,2,3,4,5,6,7,8,9} + 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(0) = [1] x1 + [0] p(1) = [1] x1 + [11] p(2) = [1] x1 + [4] p(3) = [1] x1 + [5] p(4) = [1] x1 + [5] p(5) = [1] x1 + [11] p(6) = [1] x1 + [11] p(7) = [1] x1 + [0] p(8) = [1] x1 + [0] p(9) = [1] x1 + [15] Following rules are strictly oriented: 2(6(x1)) = [1] x1 + [15] > [1] x1 + [10] = 4(3(x1)) 3(5(x1)) = [1] x1 + [16] > [1] x1 + [15] = 8(9(7(x1))) 9(x1) = [1] x1 + [15] > [1] x1 + [14] = 3(2(3(x1))) Following rules are (at-least) weakly oriented: 3(1(x1)) = [1] x1 + [16] >= [1] x1 + [16] = 4(1(x1)) 3(8(x1)) = [1] x1 + [5] >= [1] x1 + [9] = 3(2(7(x1))) 3(9(x1)) = [1] x1 + [20] >= [1] x1 + [20] = 9(3(x1)) 5(9(x1)) = [1] x1 + [26] >= [1] x1 + [26] = 2(6(5(x1))) 7(1(x1)) = [1] x1 + [11] >= [1] x1 + [26] = 6(9(x1)) 7(5(x1)) = [1] x1 + [11] >= [1] x1 + [11] = 1(0(x1)) 8(4(x1)) = [1] x1 + [5] >= [1] x1 + [11] = 6(x1) 8(8(4(x1))) = [1] x1 + [5] >= [1] x1 + [26] = 1(9(x1)) 9(x1) = [1] x1 + [15] >= [1] x1 + [15] = 5(0(2(x1))) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 3: WeightGap. WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: 3(8(x1)) -> 3(2(7(x1))) 3(9(x1)) -> 9(3(x1)) 7(1(x1)) -> 6(9(x1)) 8(4(x1)) -> 6(x1) 8(8(4(x1))) -> 1(9(x1)) - Weak TRS: 2(6(x1)) -> 4(3(x1)) 3(1(x1)) -> 4(1(x1)) 3(5(x1)) -> 8(9(7(x1))) 5(9(x1)) -> 2(6(5(x1))) 7(5(x1)) -> 1(0(x1)) 9(x1) -> 3(2(3(x1))) 9(x1) -> 5(0(2(x1))) - Signature: {2/1,3/1,5/1,7/1,8/1,9/1} / {0/1,1/1,4/1,6/1} - Obligation: innermost derivational complexity wrt. signature {0,1,2,3,4,5,6,7,8,9} + 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(0) = [1] x1 + [0] p(1) = [1] x1 + [0] p(2) = [1] x1 + [0] p(3) = [1] x1 + [1] p(4) = [1] x1 + [1] p(5) = [1] x1 + [2] p(6) = [1] x1 + [2] p(7) = [1] x1 + [0] p(8) = [1] x1 + [1] p(9) = [1] x1 + [2] Following rules are strictly oriented: 3(8(x1)) = [1] x1 + [2] > [1] x1 + [1] = 3(2(7(x1))) 8(8(4(x1))) = [1] x1 + [3] > [1] x1 + [2] = 1(9(x1)) Following rules are (at-least) weakly oriented: 2(6(x1)) = [1] x1 + [2] >= [1] x1 + [2] = 4(3(x1)) 3(1(x1)) = [1] x1 + [1] >= [1] x1 + [1] = 4(1(x1)) 3(5(x1)) = [1] x1 + [3] >= [1] x1 + [3] = 8(9(7(x1))) 3(9(x1)) = [1] x1 + [3] >= [1] x1 + [3] = 9(3(x1)) 5(9(x1)) = [1] x1 + [4] >= [1] x1 + [4] = 2(6(5(x1))) 7(1(x1)) = [1] x1 + [0] >= [1] x1 + [4] = 6(9(x1)) 7(5(x1)) = [1] x1 + [2] >= [1] x1 + [0] = 1(0(x1)) 8(4(x1)) = [1] x1 + [2] >= [1] x1 + [2] = 6(x1) 9(x1) = [1] x1 + [2] >= [1] x1 + [2] = 3(2(3(x1))) 9(x1) = [1] x1 + [2] >= [1] x1 + [2] = 5(0(2(x1))) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 4: NaturalMI. WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: 3(9(x1)) -> 9(3(x1)) 7(1(x1)) -> 6(9(x1)) 8(4(x1)) -> 6(x1) - Weak TRS: 2(6(x1)) -> 4(3(x1)) 3(1(x1)) -> 4(1(x1)) 3(5(x1)) -> 8(9(7(x1))) 3(8(x1)) -> 3(2(7(x1))) 5(9(x1)) -> 2(6(5(x1))) 7(5(x1)) -> 1(0(x1)) 8(8(4(x1))) -> 1(9(x1)) 9(x1) -> 3(2(3(x1))) 9(x1) -> 5(0(2(x1))) - Signature: {2/1,3/1,5/1,7/1,8/1,9/1} / {0/1,1/1,4/1,6/1} - Obligation: innermost derivational complexity wrt. signature {0,1,2,3,4,5,6,7,8,9} + Applied Processor: NaturalMI {miDimension = 3, 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(0) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] p(1) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] p(2) = [1 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [0] p(3) = [1 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [1] p(4) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] p(5) = [1 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [0] p(6) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] p(7) = [1 0 0] [0] [0 0 1] x1 + [0] [0 0 0] [1] p(8) = [1 1 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] p(9) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] Following rules are strictly oriented: 8(4(x1)) = [1 0 0] [1] [0 0 0] x1 + [0] [0 0 0] [1] > [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 6(x1) Following rules are (at-least) weakly oriented: 2(6(x1)) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] >= [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] = 4(3(x1)) 3(1(x1)) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] = 4(1(x1)) 3(5(x1)) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 8(9(7(x1))) 3(8(x1)) = [1 1 0] [0] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 3(2(7(x1))) 3(9(x1)) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 9(3(x1)) 5(9(x1)) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] >= [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] = 2(6(5(x1))) 7(1(x1)) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 6(9(x1)) 7(5(x1)) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 1(0(x1)) 8(8(4(x1))) = [1 0 0] [1] [0 0 0] x1 + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 1(9(x1)) 9(x1) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 3(2(3(x1))) 9(x1) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] = 5(0(2(x1))) * Step 5: NaturalMI. WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: 3(9(x1)) -> 9(3(x1)) 7(1(x1)) -> 6(9(x1)) - Weak TRS: 2(6(x1)) -> 4(3(x1)) 3(1(x1)) -> 4(1(x1)) 3(5(x1)) -> 8(9(7(x1))) 3(8(x1)) -> 3(2(7(x1))) 5(9(x1)) -> 2(6(5(x1))) 7(5(x1)) -> 1(0(x1)) 8(4(x1)) -> 6(x1) 8(8(4(x1))) -> 1(9(x1)) 9(x1) -> 3(2(3(x1))) 9(x1) -> 5(0(2(x1))) - Signature: {2/1,3/1,5/1,7/1,8/1,9/1} / {0/1,1/1,4/1,6/1} - Obligation: innermost derivational complexity wrt. signature {0,1,2,3,4,5,6,7,8,9} + Applied Processor: NaturalMI {miDimension = 3, miDegree = 2, 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 2 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(0) = [1 1 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(1) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] p(2) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(3) = [1 0 0] [0] [0 1 1] x1 + [0] [0 0 0] [1] p(4) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(5) = [1 1 1] [0] [0 0 0] x1 + [0] [0 0 0] [1] p(6) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] p(7) = [1 1 0] [0] [0 0 1] x1 + [0] [0 0 0] [0] p(8) = [1 1 0] [0] [0 0 1] x1 + [0] [0 0 0] [1] p(9) = [1 0 0] [0] [0 1 1] x1 + [0] [0 0 0] [1] Following rules are strictly oriented: 7(1(x1)) = [1 0 0] [1] [0 0 0] x1 + [0] [0 0 0] [0] > [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] = 6(9(x1)) Following rules are (at-least) weakly oriented: 2(6(x1)) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] = 4(3(x1)) 3(1(x1)) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] = 4(1(x1)) 3(5(x1)) = [1 1 1] [0] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 1 1] [0] [0 0 0] x1 + [1] [0 0 0] [1] = 8(9(7(x1))) 3(8(x1)) = [1 1 0] [0] [0 0 1] x1 + [1] [0 0 0] [1] >= [1 1 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 3(2(7(x1))) 3(9(x1)) = [1 0 0] [0] [0 1 1] x1 + [1] [0 0 0] [1] >= [1 0 0] [0] [0 1 1] x1 + [1] [0 0 0] [1] = 9(3(x1)) 5(9(x1)) = [1 1 1] [1] [0 0 0] x1 + [0] [0 0 0] [1] >= [1 1 1] [0] [0 0 0] x1 + [0] [0 0 0] [0] = 2(6(5(x1))) 7(5(x1)) = [1 1 1] [0] [0 0 0] x1 + [1] [0 0 0] [0] >= [1 1 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] = 1(0(x1)) 8(4(x1)) = [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [0] = 6(x1) 8(8(4(x1))) = [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [1] [0 0 0] [0] = 1(9(x1)) 9(x1) = [1 0 0] [0] [0 1 1] x1 + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 3(2(3(x1))) 9(x1) = [1 0 0] [0] [0 1 1] x1 + [0] [0 0 0] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 5(0(2(x1))) * Step 6: MI. WORST_CASE(?,O(n^2)) + Considered Problem: - Strict TRS: 3(9(x1)) -> 9(3(x1)) - Weak TRS: 2(6(x1)) -> 4(3(x1)) 3(1(x1)) -> 4(1(x1)) 3(5(x1)) -> 8(9(7(x1))) 3(8(x1)) -> 3(2(7(x1))) 5(9(x1)) -> 2(6(5(x1))) 7(1(x1)) -> 6(9(x1)) 7(5(x1)) -> 1(0(x1)) 8(4(x1)) -> 6(x1) 8(8(4(x1))) -> 1(9(x1)) 9(x1) -> 3(2(3(x1))) 9(x1) -> 5(0(2(x1))) - Signature: {2/1,3/1,5/1,7/1,8/1,9/1} / {0/1,1/1,4/1,6/1} - Obligation: innermost derivational complexity wrt. signature {0,1,2,3,4,5,6,7,8,9} + Applied Processor: MI {miKind = Automaton (Just 2), miDimension = 3, miUArgs = NoUArgs, miURules = NoURules, miSelector = Just any strict-rules} + Details: We apply a matrix interpretation of kind Automaton (Just 2): Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [1 0 0] [0] [0 0 0] x_1 + [3] [0 0 1] [0] p(1) = [1 0 2] [1] [0 0 1] x_1 + [0] [0 0 0] [1] p(2) = [1 0 0] [0] [0 1 0] x_1 + [0] [0 0 0] [0] p(3) = [1 0 1] [0] [0 0 1] x_1 + [0] [0 0 1] [0] p(4) = [1 0 0] [1] [0 0 1] x_1 + [0] [0 0 0] [0] p(5) = [1 0 2] [0] [0 0 1] x_1 + [0] [0 0 0] [1] p(6) = [1 0 1] [1] [0 0 1] x_1 + [0] [0 0 0] [0] p(7) = [1 0 0] [1] [0 1 0] x_1 + [1] [0 0 1] [0] p(8) = [1 2 0] [0] [0 1 0] x_1 + [1] [0 0 0] [1] p(9) = [1 0 1] [0] [0 0 0] x_1 + [0] [0 0 1] [1] Following rules are strictly oriented: 3(9(x1)) = [1 0 2] [1] [0 0 1] x1 + [1] [0 0 1] [1] > [1 0 2] [0] [0 0 0] x1 + [0] [0 0 1] [1] = 9(3(x1)) Following rules are (at-least) weakly oriented: 2(6(x1)) = [1 0 1] [1] [0 0 1] x1 + [0] [0 0 0] [0] >= [1 0 1] [1] [0 0 1] x1 + [0] [0 0 0] [0] = 4(3(x1)) 3(1(x1)) = [1 0 2] [2] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 2] [2] [0 0 0] x1 + [1] [0 0 0] [0] = 4(1(x1)) 3(5(x1)) = [1 0 2] [1] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 1] [1] [0 0 0] x1 + [1] [0 0 0] [1] = 8(9(7(x1))) 3(8(x1)) = [1 2 0] [1] [0 0 0] x1 + [1] [0 0 0] [1] >= [1 0 0] [1] [0 0 0] x1 + [0] [0 0 0] [0] = 3(2(7(x1))) 5(9(x1)) = [1 0 3] [2] [0 0 1] x1 + [1] [0 0 0] [1] >= [1 0 2] [2] [0 0 0] x1 + [1] [0 0 0] [0] = 2(6(5(x1))) 7(1(x1)) = [1 0 2] [2] [0 0 1] x1 + [1] [0 0 0] [1] >= [1 0 2] [2] [0 0 1] x1 + [1] [0 0 0] [0] = 6(9(x1)) 7(5(x1)) = [1 0 2] [1] [0 0 1] x1 + [1] [0 0 0] [1] >= [1 0 2] [1] [0 0 1] x1 + [0] [0 0 0] [1] = 1(0(x1)) 8(4(x1)) = [1 0 2] [1] [0 0 1] x1 + [1] [0 0 0] [1] >= [1 0 1] [1] [0 0 1] x1 + [0] [0 0 0] [0] = 6(x1) 8(8(4(x1))) = [1 0 4] [3] [0 0 1] x1 + [2] [0 0 0] [1] >= [1 0 3] [3] [0 0 1] x1 + [1] [0 0 0] [1] = 1(9(x1)) 9(x1) = [1 0 1] [0] [0 0 0] x1 + [0] [0 0 1] [1] >= [1 0 1] [0] [0 0 0] x1 + [0] [0 0 0] [0] = 3(2(3(x1))) 9(x1) = [1 0 1] [0] [0 0 0] x1 + [0] [0 0 1] [1] >= [1 0 0] [0] [0 0 0] x1 + [0] [0 0 0] [1] = 5(0(2(x1))) * Step 7: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: 2(6(x1)) -> 4(3(x1)) 3(1(x1)) -> 4(1(x1)) 3(5(x1)) -> 8(9(7(x1))) 3(8(x1)) -> 3(2(7(x1))) 3(9(x1)) -> 9(3(x1)) 5(9(x1)) -> 2(6(5(x1))) 7(1(x1)) -> 6(9(x1)) 7(5(x1)) -> 1(0(x1)) 8(4(x1)) -> 6(x1) 8(8(4(x1))) -> 1(9(x1)) 9(x1) -> 3(2(3(x1))) 9(x1) -> 5(0(2(x1))) - Signature: {2/1,3/1,5/1,7/1,8/1,9/1} / {0/1,1/1,4/1,6/1} - Obligation: innermost derivational complexity wrt. signature {0,1,2,3,4,5,6,7,8,9} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^2))