Average Error: 0.0 → 0.0
Time: 13.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 r1975485 = re;
        double r1975486 = exp(r1975485);
        double r1975487 = im;
        double r1975488 = sin(r1975487);
        double r1975489 = r1975486 * r1975488;
        return r1975489;
}
↓
double f(double re, double im) {
        double r1975490 = im;
        double r1975491 = sin(r1975490);
        double r1975492 = re;
        double r1975493 = exp(r1975492);
        double r1975494 = r1975491 * r1975493;
        return r1975494;
}

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