Average Error: 0.0 → 0.0

Time: 7.7s

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 r584861 = re;
        double r584862 = exp(r584861);
        double r584863 = im;
        double r584864 = sin(r584863);
        double r584865 = r584862 * r584864;
        return r584865;
}

↓

double f(double re, double im) {
        double r584866 = im;
        double r584867 = sin(r584866);
        double r584868 = re;
        double r584869 = exp(r584868);
        double r584870 = r584867 * r584869;
        return r584870;
}

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 2019152 +o rules:numerics
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))