1 | 22. c@0 = c f:( L[c@0]  n). increasing(f;L[c@0]) & ( s: L[c@0] List. ||s|| = k  ( x,y: ||s||. x < y  s[x] < s[y])  G(map(f;s)) = c@0) | 60 steps |
  |
2 | 22. c@0 = c f:( L[c@0]  n). increasing(f;L[c@0]) & ( s: L[c@0] List. ||s|| = k  ( x,y: ||s||. x < y  s[x] < s[y])  G(map(f;s)) = c@0) | 9 steps |