Average Error: 0.0 → 0.0

Time: 7.1s

Precision: 64

\[e^{re} \cdot \sin im\]

↓

\[\sin im \cdot e^{re}\]

e^{re} \cdot \sin im

↓

\sin im \cdot e^{re}

double f(double re, double im) {
        double r672394 = re;
        double r672395 = exp(r672394);
        double r672396 = im;
        double r672397 = sin(r672396);
        double r672398 = r672395 * r672397;
        return r672398;
}

↓

double f(double re, double im) {
        double r672399 = im;
        double r672400 = sin(r672399);
        double r672401 = re;
        double r672402 = exp(r672401);
        double r672403 = r672400 * r672402;
        return r672403;
}

Error

The X axis uses an exponential scale — Bits error versus `re`

Try it out

In
Out

Enter valid numbers for all inputs

Derivation

Initial program 0.0
\[e^{re} \cdot \sin im\]
Final simplification0.0
\[\leadsto \sin im \cdot e^{re}\]

Reproduce

herbie shell --seed 2019153 +o rules:numerics
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))