> What is the thing that is not provable but constructible?
Just look at the grandparent message for an example: "An actual practical statement that is unprovable in Peano arithmetic is Goodstein's theorem"
Or proving the Collatz Conjecture. You need only basic algebra to build it, but something much more complex to prove it (if it is provable)