How to find Missing Prime numbers from any given sequence of integers

import java.util.ArrayList;
import java.util.Arrays;

//Define the functional interface with SAM 'Checkprime'
interface Checkprime {
	public boolean prime(int tmp);
}

public class MissingPrimeNumbers {

	public static void main(String[] args) {

		// The input sequence of integers is numList
		ArrayList<Integer> numList = new ArrayList<>(Arrays.asList(1, 2, 4, 6, 7, 11, 14, 20, 22));
		// The finalList store the all missing prime numbers
		ArrayList<Integer> finalList = new ArrayList<>();
		/*
		 * This tList (temporary list) stores the intermediate prime numbers between
		 * each consecutive numbers, from the given initial sequence of integers
		 */
		ArrayList<Integer> tList = new ArrayList<>();
		System.out.println("The given Sequence of the numbers List (I/P)");
		System.out.println(numList);
		int sizeOfList = numList.size();

		System.out.println("Traversing through the given sequence of the numbers List");
		for (int i = 0; i < sizeOfList - 1; i++) {
			/*
			 * Calling the method findMissingPrimes() between every pair of consecutive
			 * numbers from the given sequence
			 */
			tList = findMissingPrimes(numList.get(i), numList.get(i + 1));
			System.out.println("Intermediate Prime numbers List between " + numList.get(i) + " and " + numList.get(i + 1));
			System.out.println(tList);
			/*
			 * During each iteration merge the Intermediate prime numbers list, if any found
			 * between every pair of consecutive numbers with the finalList
			 */
			finalList.addAll(tList);
		}
		System.out.println("Final Missing Prime Numbers list sequence  (O/P)");
		System.out.println(finalList);
	}

	private static ArrayList<Integer> findMissingPrimes(Integer num1, Integer num2) {

		/* Define the Lambda expression for the functional interface Checkprime */
		Checkprime Cp = ((num) -> {
			/* Initialize the lower and upper boundary values in the for loop */
			int bvalToCheck = (int) Math.sqrt(num);
			for (int i = 2; i <= bvalToCheck; i++)
				if (num % i == 0)
					return false;
			return true;
		});
		/*
		 * This code checks whether each number is prime or not within the given range
		 * of num1 and num2
		 */
		ArrayList<Integer> rProcess = new ArrayList<>();
		for (int i = num1 + 1; i < num2; i++) {
			if (Cp.prime(i))
				rProcess.add(i);
		}
		return rProcess;
	}
}