Average Error: 0.0 → 0.0
Time: 11.9s
Precision: 64
Ground Truth: 128
\[re \cdot re - im \cdot im\]
⬇
\[\left(re + im\right) \cdot \left(re - im\right)\]

Error

Bits error versus re

Bits error versus im

Derivation

  1. Initial program 0.0

    \[re \cdot re - im \cdot im\]
  2. Using strategy rm

  3. Applied square-unmult 0.0

    \[\leadsto re \cdot re - \color{blue}{{im}^2}\]

  4. Applied square-unmult 0.0

    \[\leadsto \color{blue}{{re}^2} - {im}^2\]

  5. Applied difference-of-squares 0.0

    \[\leadsto \color{blue}{\left(re + im\right) \cdot \left(re - im\right)}\]
  6. Removed slow pow expressions

Runtime

Total time: 11.9s Debug log

Please include this information when filing a bug report:

herbie --seed '#(793653448 2840744778 3622174101 1771027610 3641929900 314383587)'
(FPCore (re im)
  :name "math.square on complex, real part"
  (- (* re re) (* im im)))