Average Error: 0.0 → 0.0
Time: 18.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 r1960279 = re;
        double r1960280 = exp(r1960279);
        double r1960281 = im;
        double r1960282 = sin(r1960281);
        double r1960283 = r1960280 * r1960282;
        return r1960283;
}
↓
double f(double re, double im) {
        double r1960284 = im;
        double r1960285 = sin(r1960284);
        double r1960286 = re;
        double r1960287 = exp(r1960286);
        double r1960288 = r1960285 * r1960287;
        return r1960288;
}

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