Average Error: 0.0 → 0.0

Time: 10.9s

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 r740449 = re;
        double r740450 = exp(r740449);
        double r740451 = im;
        double r740452 = sin(r740451);
        double r740453 = r740450 * r740452;
        return r740453;
}

↓

double f(double re, double im) {
        double r740454 = im;
        double r740455 = sin(r740454);
        double r740456 = re;
        double r740457 = exp(r740456);
        double r740458 = r740455 * r740457;
        return r740458;
}

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