* Step 1: MI WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(g(x),y,y) -> g(f(x,x,y)) - Signature: {f/3} / {g/1} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {g} + Applied Processor: MI {miKind = MaximalMatrix (UpperTriangular (Multiplicity Nothing)), miDimension = 1, miUArgs = UArgs, miURules = URules, miSelector = Just any strict-rules} + Details: We apply a matrix interpretation of kind MaximalMatrix (UpperTriangular (Multiplicity Nothing)): The following argument positions are considered usable: uargs(g) = {1} Following symbols are considered usable: all TcT has computed the following interpretation: p(f) = [8] x_1 + [12] x_3 + [10] p(g) = [1] x_1 + [1] Following rules are strictly oriented: f(g(x),y,y) = [8] x + [12] y + [18] > [8] x + [12] y + [11] = g(f(x,x,y)) Following rules are (at-least) weakly oriented: * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(g(x),y,y) -> g(f(x,x,y)) - Signature: {f/3} / {g/1} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {g} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))