MAYBE * Step 1: DependencyPairs MAYBE + Considered Problem: - Strict TRS: f(h(x),y) -> h(f(y,f(x,h(f(a(),a()))))) - Signature: {f/2} / {a/0,h/1} - Obligation: innermost runtime complexity wrt. defined symbols {f} and constructors {a,h} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs f#(h(x),y) -> c_1(f#(y,f(x,h(f(a(),a())))),f#(x,h(f(a(),a()))),f#(a(),a())) Weak DPs and mark the set of starting terms. * Step 2: SimplifyRHS MAYBE + Considered Problem: - Strict DPs: f#(h(x),y) -> c_1(f#(y,f(x,h(f(a(),a())))),f#(x,h(f(a(),a()))),f#(a(),a())) - Weak TRS: f(h(x),y) -> h(f(y,f(x,h(f(a(),a()))))) - Signature: {f/2,f#/2} / {a/0,h/1,c_1/3} - Obligation: innermost runtime complexity wrt. defined symbols {f#} and constructors {a,h} + Applied Processor: SimplifyRHS + Details: Consider the dependency graph 1:S:f#(h(x),y) -> c_1(f#(y,f(x,h(f(a(),a())))),f#(x,h(f(a(),a()))),f#(a(),a())) -->_2 f#(h(x),y) -> c_1(f#(y,f(x,h(f(a(),a())))),f#(x,h(f(a(),a()))),f#(a(),a())):1 -->_1 f#(h(x),y) -> c_1(f#(y,f(x,h(f(a(),a())))),f#(x,h(f(a(),a()))),f#(a(),a())):1 Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified: f#(h(x),y) -> c_1(f#(y,f(x,h(f(a(),a())))),f#(x,h(f(a(),a())))) * Step 3: Failure MAYBE + Considered Problem: - Strict DPs: f#(h(x),y) -> c_1(f#(y,f(x,h(f(a(),a())))),f#(x,h(f(a(),a())))) - Weak TRS: f(h(x),y) -> h(f(y,f(x,h(f(a(),a()))))) - Signature: {f/2,f#/2} / {a/0,h/1,c_1/2} - Obligation: innermost runtime complexity wrt. defined symbols {f#} and constructors {a,h} + Applied Processor: EmptyProcessor + Details: The problem is still open. MAYBE