Average Error: 0.0 → 0.0
Time: 16.6s
Precision: 64
\[e^{re} \cdot \sin im\]
↓
\[e^{re} \cdot \sin im\]
e^{re} \cdot \sin im
↓
e^{re} \cdot \sin im
double f(double re, double im) {
        double r1659635 = re;
        double r1659636 = exp(r1659635);
        double r1659637 = im;
        double r1659638 = sin(r1659637);
        double r1659639 = r1659636 * r1659638;
        return r1659639;
}
↓
double f(double re, double im) {
        double r1659640 = re;
        double r1659641 = exp(r1659640);
        double r1659642 = im;
        double r1659643 = sin(r1659642);
        double r1659644 = r1659641 * r1659643;
        return r1659644;
}

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. Using strategy rm

  3. Applied *-commutative0.0

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

  4. Final simplification0.0

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

Reproduce

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