Average Error: 0.0 → 0.0
Time: 21.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 r1292313 = re;
        double r1292314 = exp(r1292313);
        double r1292315 = im;
        double r1292316 = sin(r1292315);
        double r1292317 = r1292314 * r1292316;
        return r1292317;
}
↓
double f(double re, double im) {
        double r1292318 = im;
        double r1292319 = sin(r1292318);
        double r1292320 = re;
        double r1292321 = exp(r1292320);
        double r1292322 = r1292319 * r1292321;
        return r1292322;
}

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