Voynich Manuscript: Python Program for Rules of Omission

The following Python Program is able to omit the alternating pattern for two layers of letter repetition in initials and finals; a program with understanding of the second rule for two given words. If it has errors please comment below.

print('Please Enter Voynich Transcribed Words:')

x1=input('word one: ')

x2=input('word two: ')

y1=[x1,x2]

if x1[-1]==x2[-1]:

   x1a=x1.replace(x1[-1],"")

   x2a=x2.replace(x2[-1],"")

   y2=[x1a,x2a]

   print('Result for first layer removal of final letter=', y2)

   if x1a[0]==x2a[0]:

      x1b=x1a.replace(x1a[0],"")

      x2b=x2a.replace(x2a[0],"")

      y3=[x1b,x2b]

      print('Result for first layer removal of initial and final letters=', y3)

      if x1b[-1]==x1b[-1]:

         x1c=x1b.replace(x1b[-1],"")

         x2c=x2b.replace(x2a[-1],"")

         y6=[x1c,x2c]

         print('Result for second layer removal of final letter=', y6)

         if x1c[0]==x1c[0]:

            x1d=x1c.replace(x1c[0],"")

            x2d=x2c.replace(x2c[0],"")

            y7=[x1d,x2d]

            print('Result for first layer removal of initial and final letters=', y7)            

if x1[0]==x2[0]:

   x1a=x1.replace(x1[0],"")

   x2a=x2.replace(x2[0],"")

   y4=[x1a,x2a]

   print('Result for first layer removal of initial letter=', y4)

   if x1a[-1]==x2a[-1]:

      x1b=x1a.replace(x1a[-1],"")

      x2b=x2a.replace(x2a[-1],"")

      y5=[x1b,x2b]

      print('Result for first layer removal of initial and final letters=',y5)

      if x1b[0]==x2b[0]:

         x1c=x1b.replace(x1b[0],"")

         x2c=x2b.replace(x2b[0],"")

         y8=[x1c,x2c]

         print('Result for second layer removal of initial letter=',y8)

         if x1c[-1]==x2c[-1]:

            x1d=x1c.replace(x1c[-1],"")

            x2d=x2c.replace(x2c[-1],"")

            y9=[x1d,x2d]

            print('Result for second layer removal of initial and final letters',y9)