We conjecture that if a system S ⊆ {x i + x j = x k , x i • x j = x k : i, j, k ∈ {1,. .. , n}} has only finitely many solutions in integers x 1 ,. .. , x n , then each such solution (x 1 ,. .. , x n) satisfies max |x 1 |,. .. , |x n | ≤ 2 2 n−1. The conjecture implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set. We describe an algorithm whose execution never terminates. If the conjecture is true, then the algorithm sequentially displays all integers n ≥ 2. If the conjecture is false, then the algorithm has a finite output which ends with an integer tuple (a 1 ,. .. , a n), where n ≥ 4, 2 2 n−1 < max |a 1 |,. .. , |a n | ≤ 2 2 n , and the system {x i + x j = x k : (i, j, k ∈ {1,. .. , n}) ∧ (a i + a j = a k)} ∪ {x i • x j = x k : (i, j, k ∈ {1,. .. , n}) ∧ (a i • a j = a k)} is a counterexample to the conjecture. The algorithm is implemented in MuPAD and Pascal.