Average Error: 0.0 → 0.0

Time: 16.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 r978551 = re;
        double r978552 = exp(r978551);
        double r978553 = im;
        double r978554 = sin(r978553);
        double r978555 = r978552 * r978554;
        return r978555;
}

↓

double f(double re, double im) {
        double r978556 = im;
        double r978557 = sin(r978556);
        double r978558 = re;
        double r978559 = exp(r978558);
        double r978560 = r978557 * r978559;
        return r978560;
}

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