The results, presented in Table 6, show that by avoiding any type of lookahead one can achieve fast runtime, while compromising proof quality.
both exhaustive and local lookahead yield better proofs and accuracy, while local lookahead is more than 4 times faster than exhaustive lookahead.