Average Error: 0.0 → 0.0
Time: 3.5s
Precision: 64
\[re \cdot im + im \cdot re\]
↓
\[im \cdot \left(re + re\right)\]
re \cdot im + im \cdot re
↓
im \cdot \left(re + re\right)
double f(double re, double im) {
        double r68201 = re;
        double r68202 = im;
        double r68203 = r68201 * r68202;
        double r68204 = r68202 * r68201;
        double r68205 = r68203 + r68204;
        return r68205;
}
↓
double f(double re, double im) {
        double r68206 = im;
        double r68207 = re;
        double r68208 = r68207 + r68207;
        double r68209 = r68206 * r68208;
        return r68209;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[re \cdot im + im \cdot re\]

  2. Simplified0.0

    \[\leadsto \color{blue}{re \cdot im + re \cdot im}\]
  3. Using strategy rm

  4. Applied distribute-rgt-out0.0

    \[\leadsto \color{blue}{im \cdot \left(re + re\right)}\]

  5. Final simplification0.0

    \[\leadsto im \cdot \left(re + re\right)\]

Reproduce

herbie shell --seed 2019154 
(FPCore (re im)
  :name "math.square on complex, imaginary part"
  (+ (* re im) (* im re)))