Average Error: 0.0 → 0.0

Time: 15.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 r861751 = re;
        double r861752 = exp(r861751);
        double r861753 = im;
        double r861754 = sin(r861753);
        double r861755 = r861752 * r861754;
        return r861755;
}

↓

double f(double re, double im) {
        double r861756 = im;
        double r861757 = sin(r861756);
        double r861758 = re;
        double r861759 = exp(r861758);
        double r861760 = r861757 * r861759;
        return r861760;
}

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