Exhaustive proof search machine

Checking every candidate in a finite box and keeping only the one that survives the Peano-style checker

3
1 + 3 = ?
Candidate space for ? : {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}