Can Z3 test the validity of formulas containing recursive functions?

Question

I am trying to use some examples of the Z3 tutorial that uses recursive functions. I tried the following example.

• Fibonacci (section 8.3)
• IsNat (section 8.3)
• Inductive (section 10.5)

Z3 play out all the above examples. But it seems that the textbook implies that only the Inductive does not end.

Can Z3 test the validity of formulas containing recursive functions, or can it not handle any inductive facts?

Answer 1

Z3 Z3.

Z3 :

• , Z3, . . . , Z3 fib, . Z3 .

• Z3 . 2 3 , Z3 , . .

TODO, .