Average Error: 0.0 → 0.0
Time: 22.5s
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 r1375363 = re;
        double r1375364 = exp(r1375363);
        double r1375365 = im;
        double r1375366 = sin(r1375365);
        double r1375367 = r1375364 * r1375366;
        return r1375367;
}
↓
double f(double re, double im) {
        double r1375368 = im;
        double r1375369 = sin(r1375368);
        double r1375370 = re;
        double r1375371 = exp(r1375370);
        double r1375372 = r1375369 * r1375371;
        return r1375372;
}

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