YES

The TRS could be proven terminating. The proof took 52 ms.

The following DP Processors were used


Problem 1 was processed with processor SubtermCriterion (0ms).

Problem 1: SubtermCriterion

Dependency Pair Problem

Dependency Pairs

fib#(s(s(x))) → fib#(x)fib#(s(s(x))) → fib#(s(x))

Rewrite Rules

fib(0) → 0fib(s(0)) → s(0)
fib(s(s(x))) → +(fib(s(x)), fib(x))

Original Signature

Termination of terms over the following signature is verified: 0, s, +, fib

Strategy

Projection

The following projection was used:

Thus, the following dependency pairs are removed:

fib#(s(s(x))) → fib#(x)fib#(s(s(x))) → fib#(s(x))