*** 1 Progress [(O(1),O(1))] *** Considered Problem: Strict DP Rules: Strict TRS Rules: a(b(x)) -> a(c(b(x))) Weak DP Rules: Weak TRS Rules: Signature: {a/1} / {b/1,c/1} Obligation: Innermost basic terms: {a}/{b,c} Applied Processor: DependencyPairs {dpKind_ = DT} Proof: We add the following dependency tuples: Strict DPs a#(b(x)) -> c_1(a#(c(b(x)))) Weak DPs and mark the set of starting terms. *** 1.1 Progress [(O(1),O(1))] *** Considered Problem: Strict DP Rules: a#(b(x)) -> c_1(a#(c(b(x)))) Strict TRS Rules: Weak DP Rules: Weak TRS Rules: a(b(x)) -> a(c(b(x))) Signature: {a/1,a#/1} / {b/1,c/1,c_1/1} Obligation: Innermost basic terms: {a#}/{b,c} Applied Processor: UsableRules Proof: We replace rewrite rules by usable rules: a#(b(x)) -> c_1(a#(c(b(x)))) *** 1.1.1 Progress [(O(1),O(1))] *** Considered Problem: Strict DP Rules: a#(b(x)) -> c_1(a#(c(b(x)))) Strict TRS Rules: Weak DP Rules: Weak TRS Rules: Signature: {a/1,a#/1} / {b/1,c/1,c_1/1} Obligation: Innermost basic terms: {a#}/{b,c} Applied Processor: Trivial Proof: Consider the dependency graph 1:S:a#(b(x)) -> c_1(a#(c(b(x)))) The dependency graph contains no loops, we remove all dependency pairs. *** 1.1.1.1 Progress [(O(1),O(1))] *** Considered Problem: Strict DP Rules: Strict TRS Rules: Weak DP Rules: Weak TRS Rules: Signature: {a/1,a#/1} / {b/1,c/1,c_1/1} Obligation: Innermost basic terms: {a#}/{b,c} Applied Processor: EmptyProcessor Proof: The problem is already closed. The intended complexity is O(1).