Average Error: 0.0 → 0
Time: 3.1s
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 r56470 = re;
        double r56471 = im;
        double r56472 = r56470 * r56471;
        double r56473 = r56471 * r56470;
        double r56474 = r56472 + r56473;
        return r56474;
}
↓
double f(double re, double im) {
        double r56475 = im;
        double r56476 = re;
        double r56477 = r56476 + r56476;
        double r56478 = r56475 * r56477;
        return r56478;
}

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

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

  5. Final simplification0

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

Reproduce

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