Average Error: 0.0 → 0.0

Time: 6.2s

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 r692106 = re;
        double r692107 = exp(r692106);
        double r692108 = im;
        double r692109 = sin(r692108);
        double r692110 = r692107 * r692109;
        return r692110;
}

↓

double f(double re, double im) {
        double r692111 = im;
        double r692112 = sin(r692111);
        double r692113 = re;
        double r692114 = exp(r692113);
        double r692115 = r692112 * r692114;
        return r692115;
}

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