p=2 k=1 L: step 1: |computed|=2 |claimed P_2=S(1,1)|=2 MATCH=True
p=2 k=1 L: step 2: |computed|=1 |claimed P_3=S(2,2)|=1 MATCH=True
p=2 k=1 L: step 3: |computed|=1 |claimed P_4=S(3,3)|=1 MATCH=True
p=2 k=1 P: step 0: |computed|=8 |claimed pi_0=S(0,0)|=8 MATCH=True
p=2 k=1 P: step 1: |computed|=2 |claimed pi_1=S(1,1)|=2 MATCH=True
p=2 k=1 P: step 2: |computed|=1 |claimed pi_2=S(2,3)|=1 MATCH=True
p=2 k=1 P*: step 0: |computed|=2 |claimed pi*_1=S(1,1)|=2 MATCH=True
p=2 k=1 P*: step 1: |computed|=1 |claimed pi*_2=S(2,3)|=1 MATCH=True
p=2 k=1 P*: step 2: |computed|=1 |claimed pi*_3=S(3,7)|=1 MATCH=True
p=2 k=1 F: step 0: |computed|=2 |claimed Phi_1=S(1,1)|=2 MATCH=True
p=2 k=1 F: step 1: |computed|=1 |claimed Phi_2=S(2,3)|=1 MATCH=True
p=2 k=1 F: step 2: |computed|=1 |claimed Phi_3=S(3,7)|=1 MATCH=True
p=2 k=1 D: step 2: |computed|=2 |claimed D_2=S(1,1)|=2 MATCH=True
p=2 k=1 D: step 3: |computed|=1 |claimed D_3=S(2,2)|=1 MATCH=True
CASE p=2 k=1: all_match=True steps=14 time=0.0s
p=2 k=2 L: step 1: |computed|=16 |claimed P_2=S(1,1)|=16 MATCH=True
p=2 k=2 L: step 2: |computed|=4 |claimed P_3=S(2,2)|=4 MATCH=True
p=2 k=2 L: step 3: |computed|=2 |claimed P_4=S(3,3)|=2 MATCH=True
p=2 k=2 L: step 4: |computed|=1 |claimed P_5=S(4,4)|=1 MATCH=True
p=2 k=2 L: step 5: |computed|=1 |claimed P_6=S(5,5)|=1 MATCH=True
p=2 k=2 P: step 0: |computed|=64 |claimed pi_0=S(0,0)|=64 MATCH=True
p=2 k=2 P: step 1: |computed|=16 |claimed pi_1=S(1,1)|=16 MATCH=True
p=2 k=2 P: step 2: |computed|=2 |claimed pi_2=S(2,3)|=2 MATCH=True
p=2 k=2 P: step 3: |computed|=1 |claimed pi_3=S(3,7)|=1 MATCH=True
p=2 k=2 P*: step 0: |computed|=16 |claimed pi*_1=S(1,1)|=16 MATCH=True
p=2 k=2 P*: step 1: |computed|=2 |claimed pi*_2=S(2,3)|=2 MATCH=True
p=2 k=2 P*: step 2: |computed|=1 |claimed pi*_3=S(3,7)|=1 MATCH=True
p=2 k=2 P*: step 3: |computed|=1 |claimed pi*_4=S(4,15)|=1 MATCH=True
p=2 k=2 F: step 0: |computed|=16 |claimed Phi_1=S(1,1)|=16 MATCH=True
p=2 k=2 F: step 1: |computed|=2 |claimed Phi_2=S(2,3)|=2 MATCH=True
p=2 k=2 F: step 2: |computed|=1 |claimed Phi_3=S(3,7)|=1 MATCH=True
p=2 k=2 F: step 3: |computed|=1 |claimed Phi_4=S(4,15)|=1 MATCH=True
p=2 k=2 D: step 2: |computed|=16 |claimed D_2=S(1,1)|=16 MATCH=True
p=2 k=2 D: step 3: |computed|=4 |claimed D_3=S(2,2)|=4 MATCH=True
p=2 k=2 D: step 4: |computed|=2 |claimed D_4=S(2,3)|=2 MATCH=True
p=2 k=2 D: step 5: |computed|=1 |claimed D_5=S(3,4)|=1 MATCH=True
CASE p=2 k=2: all_match=True steps=21 time=0.0s
p=3 k=1 L: step 1: |computed|=9 |claimed P_2=S(1,1)|=9 MATCH=True
p=3 k=1 L: step 2: |computed|=3 |claimed P_3=S(2,2)|=3 MATCH=True
p=3 k=1 L: step 3: |computed|=1 |claimed P_4=S(3,3)|=1 MATCH=True
p=3 k=1 L: step 4: |computed|=1 |claimed P_5=S(4,4)|=1 MATCH=True
p=3 k=1 P: step 0: |computed|=81 |claimed pi_0=S(0,0)|=81 MATCH=True
p=3 k=1 P: step 1: |computed|=3 |claimed pi_1=S(1,2)|=3 MATCH=True
p=3 k=1 P: step 2: |computed|=1 |claimed pi_2=S(2,8)|=1 MATCH=True
p=3 k=1 P*: step 0: |computed|=3 |claimed pi*_1=S(1,2)|=3 MATCH=True
p=3 k=1 P*: step 1: |computed|=1 |claimed pi*_2=S(2,8)|=1 MATCH=True
p=3 k=1 P*: step 2: |computed|=1 |claimed pi*_3=S(3,26)|=1 MATCH=True
p=3 k=1 F: step 0: |computed|=9 |claimed Phi_1=S(1,1)|=9 MATCH=True
p=3 k=1 F: step 1: |computed|=1 |claimed Phi_2=S(2,4)|=1 MATCH=True
p=3 k=1 F: step 2: |computed|=1 |claimed Phi_3=S(3,13)|=1 MATCH=True
p=3 k=1 D: step 2: |computed|=9 |claimed D_2=S(1,1)|=9 MATCH=True
p=3 k=1 D: step 3: |computed|=3 |claimed D_3=S(1,2)|=3 MATCH=True
p=3 k=1 D: step 4: |computed|=1 |claimed D_4=S(2,3)|=1 MATCH=True
CASE p=3 k=1: all_match=True steps=16 time=0.0s
TOTAL_STEPS 51 ALL_MATCH True
