Average Error: 0.0 → 0.0
Time: 28.2s
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 r1500555 = re;
        double r1500556 = exp(r1500555);
        double r1500557 = im;
        double r1500558 = sin(r1500557);
        double r1500559 = r1500556 * r1500558;
        return r1500559;
}
↓
double f(double re, double im) {
        double r1500560 = im;
        double r1500561 = sin(r1500560);
        double r1500562 = re;
        double r1500563 = exp(r1500562);
        double r1500564 = r1500561 * r1500563;
        return r1500564;
}

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)))