MAYBE * Step 1: WeightGap MAYBE + Considered Problem: - Strict TRS: fib(0()) -> 0() fib(s(0())) -> s(0()) fib(s(s(x))) -> +(fib(s(x)),fib(x)) - Signature: {fib/1} / {+/2,0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {fib} and constructors {+,0,s} + Applied Processor: WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny} + Details: The weightgap principle applies using the following nonconstant growth matrix-interpretation: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(+) = {1,2} Following symbols are considered usable: all TcT has computed the following interpretation: p(+) = [1] x1 + [1] x2 + [9] p(0) = [0] p(fib) = [8] p(s) = [4] Following rules are strictly oriented: fib(0()) = [8] > [0] = 0() fib(s(0())) = [8] > [4] = s(0()) Following rules are (at-least) weakly oriented: fib(s(s(x))) = [8] >= [25] = +(fib(s(x)),fib(x)) Further, it can be verified that all rules not oriented are covered by the weightgap condition. * Step 2: Failure MAYBE + Considered Problem: - Strict TRS: fib(s(s(x))) -> +(fib(s(x)),fib(x)) - Weak TRS: fib(0()) -> 0() fib(s(0())) -> s(0()) - Signature: {fib/1} / {+/2,0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {fib} and constructors {+,0,s} + Applied Processor: EmptyProcessor + Details: The problem is still open. MAYBE