Average Error: 0.0 → 0.0
Time: 6.7s
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 r1018202 = re;
        double r1018203 = exp(r1018202);
        double r1018204 = im;
        double r1018205 = sin(r1018204);
        double r1018206 = r1018203 * r1018205;
        return r1018206;
}
↓
double f(double re, double im) {
        double r1018207 = im;
        double r1018208 = sin(r1018207);
        double r1018209 = re;
        double r1018210 = exp(r1018209);
        double r1018211 = r1018208 * r1018210;
        return r1018211;
}

Error

Bits error versus re

Bits error versus im

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[e^{re} \cdot \sin im\]

  2. Final simplification0.0

    \[\leadsto \sin im \cdot e^{re}\]

Reproduce

herbie shell --seed 2019138 +o rules:numerics
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))