Why is this 'optimized' program runs at the same speed like the regular version - Prime checking Python 3.8.2

Question

Given this plain is_prime1 function which checks all the divisors from 1 to sqrt(p) with some bit-playing in order to avoid even numbers which are of-course not