Average Error: 0.0 → 0.0

Time: 4.4s

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 r487282 = re;
        double r487283 = exp(r487282);
        double r487284 = im;
        double r487285 = sin(r487284);
        double r487286 = r487283 * r487285;
        return r487286;
}

↓

double f(double re, double im) {
        double r487287 = im;
        double r487288 = sin(r487287);
        double r487289 = re;
        double r487290 = exp(r487289);
        double r487291 = r487288 * r487290;
        return r487291;
}

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