Average Error: 0.0 → 0.0

Time: 12.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 r44975 = re;
        double r44976 = exp(r44975);
        double r44977 = im;
        double r44978 = sin(r44977);
        double r44979 = r44976 * r44978;
        return r44979;
}

↓

double f(double re, double im) {
        double r44980 = im;
        double r44981 = sin(r44980);
        double r44982 = re;
        double r44983 = exp(r44982);
        double r44984 = r44981 * r44983;
        return r44984;
}

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