Average Error: 0.0 → 0.0
Time: 8.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 r1425617 = re;
        double r1425618 = exp(r1425617);
        double r1425619 = im;
        double r1425620 = sin(r1425619);
        double r1425621 = r1425618 * r1425620;
        return r1425621;
}
↓
double f(double re, double im) {
        double r1425622 = im;
        double r1425623 = sin(r1425622);
        double r1425624 = re;
        double r1425625 = exp(r1425624);
        double r1425626 = r1425623 * r1425625;
        return r1425626;
}

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