Average Error: 0.0 → 0.0

Time: 6.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 r659577 = re;
        double r659578 = exp(r659577);
        double r659579 = im;
        double r659580 = sin(r659579);
        double r659581 = r659578 * r659580;
        return r659581;
}

↓

double f(double re, double im) {
        double r659582 = im;
        double r659583 = sin(r659582);
        double r659584 = re;
        double r659585 = exp(r659584);
        double r659586 = r659583 * r659585;
        return r659586;
}

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