Average Error: 0.0 → 0.0

Time: 11.3s

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 r45141 = re;
        double r45142 = exp(r45141);
        double r45143 = im;
        double r45144 = sin(r45143);
        double r45145 = r45142 * r45144;
        return r45145;
}

↓

double f(double re, double im) {
        double r45146 = im;
        double r45147 = sin(r45146);
        double r45148 = re;
        double r45149 = exp(r45148);
        double r45150 = r45147 * r45149;
        return r45150;
}

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