☑️ Fix problems solvable by a constant fill or eliminating a redundant operation

[EssamWisam]

We have identified that a number of KernelBench problems:

• Can be solved by a kernel returning a constant output (constant fill)
• Can be solved by a kernel eliminating one of the operations completely

This results in astronomical speedups for some of these problems which does not reflect the agent's ability to perform genuine optimizations and rather reflects their ability to exploit flaws in the given program. Correspondingly, one agent performing genuine optimizations while remaining logically equivalent to the program code would likely underperform an agent that rather focuses on exploiting these flaws. Not to mention that whether the agent exploits the flaw could depend on "luck".

In proposing fixes to each of the problems we tried to look for the most minimal change that would fix the problem. All the fixes to the redundant operations flaw are non-breaking (correctness-wise).

The PR includes:

• Fix to each of the problems we identified, in one of our experiments, as flawed
• Old problem code (temporarily for testing)
• Temporary tests that prove the constant fill or redundant operation flaw exists for each of the problems fixed and that the fixes indeed work
• Changelog; see: https://github.com/EssamWisam/KernelBench/blob/5763a8a6037d43d12b99e7e6df4125d086a17f86/KernelBench/changelog/constant_fill_fixes.txt
  https://github.com/EssamWisam/KernelBench/blob/5763a8a6037d43d12b99e7e6df4125d086a17f86/KernelBench/changelog/redundant_op_fixes.txt

The changelog includes a list of todos which are problem renames. Delayed applying these until we approve the fixes.