p=2 k=3 L: step 1: |computed|=512 |claimed P_2=S(1,1)|=512 MATCH=True
p=2 k=3 L: step 2: |computed|=128 |claimed P_3=S(2,2)|=128 MATCH=True
p=2 k=3 L: step 3: |computed|=32 |claimed P_4=S(3,3)|=32 MATCH=True
p=2 k=3 L: step 4: |computed|=16 |claimed P_5=S(4,4)|=16 MATCH=True
p=2 k=3 L: step 5: |computed|=8 |claimed P_6=S(5,5)|=8 MATCH=True
p=2 k=3 L: step 6: |computed|=4 |claimed P_7=S(6,6)|=4 MATCH=True
p=2 k=3 L: step 7: |computed|=2 |claimed P_8=S(7,7)|=2 MATCH=True
p=2 k=3 L: step 8: |computed|=1 |claimed P_9=S(8,8)|=1 MATCH=True
p=2 k=3 L: step 9: |computed|=1 |claimed P_10=S(9,9)|=1 MATCH=True
p=2 k=3 P: step 0: |computed|=2048 |claimed pi_0=S(0,0)|=2048 MATCH=True
p=2 k=3 P: step 1: |computed|=512 |claimed pi_1=S(1,1)|=512 MATCH=True
p=2 k=3 P: step 2: |computed|=64 |claimed pi_2=S(2,3)|=64 MATCH=True
p=2 k=3 P: step 3: |computed|=2 |claimed pi_3=S(3,7)|=2 MATCH=True
p=2 k=3 P: step 4: |computed|=1 |claimed pi_4=S(4,15)|=1 MATCH=True
p=2 k=3 P*: step 0: |computed|=512 |claimed pi*_1=S(1,1)|=512 MATCH=True
p=2 k=3 P*: step 1: |computed|=64 |claimed pi*_2=S(2,3)|=64 MATCH=True
p=2 k=3 P*: step 2: |computed|=2 |claimed pi*_3=S(3,7)|=2 MATCH=True
p=2 k=3 P*: step 3: |computed|=1 |claimed pi*_4=S(4,15)|=1 MATCH=True
p=2 k=3 P*: step 4: |computed|=1 |claimed pi*_5=S(5,31)|=1 MATCH=True
p=2 k=3 F: step 0: |computed|=512 |claimed Phi_1=S(1,1)|=512 MATCH=True
p=2 k=3 F: step 1: |computed|=64 |claimed Phi_2=S(2,3)|=64 MATCH=True
p=2 k=3 F: step 2: |computed|=2 |claimed Phi_3=S(3,7)|=2 MATCH=True
p=2 k=3 F: step 3: |computed|=1 |claimed Phi_4=S(4,15)|=1 MATCH=True
p=2 k=3 F: step 4: |computed|=1 |claimed Phi_5=S(5,31)|=1 MATCH=True
p=2 k=3 D: step 2: |computed|=512 |claimed D_2=S(1,1)|=512 MATCH=True
p=2 k=3 D: step 3: |computed|=128 |claimed D_3=S(2,2)|=128 MATCH=True
p=2 k=3 D: step 4: |computed|=64 |claimed D_4=S(2,3)|=64 MATCH=True
p=2 k=3 D: step 5: |computed|=16 |claimed D_5=S(3,4)|=16 MATCH=True
p=2 k=3 D: step 6: |computed|=8 |claimed D_6=S(3,5)|=8 MATCH=True
p=2 k=3 D: step 7: |computed|=4 |claimed D_7=S(3,6)|=4 MATCH=True
p=2 k=3 D: step 8: |computed|=2 |claimed D_8=S(3,7)|=2 MATCH=True
p=2 k=3 D: step 9: |computed|=1 |claimed D_9=S(4,8)|=1 MATCH=True
CASE p=2 k=3: all_match=True steps=32 time=8.3s
p=5 k=1 L: step 1: |computed|=625 |claimed P_2=S(1,1)|=625 MATCH=True
p=5 k=1 L: step 2: |computed|=125 |claimed P_3=S(2,2)|=125 MATCH=True
p=5 k=1 L: step 3: |computed|=25 |claimed P_4=S(3,3)|=25 MATCH=True
p=5 k=1 L: step 4: |computed|=5 |claimed P_5=S(4,4)|=5 MATCH=True
p=5 k=1 L: step 5: |computed|=1 |claimed P_6=S(5,5)|=1 MATCH=True
p=5 k=1 L: step 6: |computed|=1 |claimed P_7=S(6,6)|=1 MATCH=True
p=5 k=1 P: step 0: |computed|=15625 |claimed pi_0=S(0,0)|=15625 MATCH=True
p=5 k=1 P: step 1: |computed|=5 |claimed pi_1=S(1,4)|=5 MATCH=True
p=5 k=1 P: step 2: |computed|=1 |claimed pi_2=S(2,24)|=1 MATCH=True
p=5 k=1 P*: step 0: |computed|=5 |claimed pi*_1=S(1,4)|=5 MATCH=True
p=5 k=1 P*: step 1: |computed|=1 |claimed pi*_2=S(2,24)|=1 MATCH=True
p=5 k=1 P*: step 2: |computed|=1 |claimed pi*_3=S(3,124)|=1 MATCH=True
p=5 k=1 F: step 0: |computed|=625 |claimed Phi_1=S(1,1)|=625 MATCH=True
p=5 k=1 F: step 1: |computed|=1 |claimed Phi_2=S(2,6)|=1 MATCH=True
p=5 k=1 F: step 2: |computed|=1 |claimed Phi_3=S(3,31)|=1 MATCH=True
p=5 k=1 D: step 2: |computed|=625 |claimed D_2=S(1,1)|=625 MATCH=True
p=5 k=1 D: step 3: |computed|=125 |claimed D_3=S(1,2)|=125 MATCH=True
p=5 k=1 D: step 4: |computed|=25 |claimed D_4=S(1,3)|=25 MATCH=True
p=5 k=1 D: step 5: |computed|=5 |claimed D_5=S(1,4)|=5 MATCH=True
p=5 k=1 D: step 6: |computed|=1 |claimed D_6=S(2,5)|=1 MATCH=True
CASE p=5 k=1: all_match=True steps=20 time=353.2s
