Average Error: 0.0 → 0.0
Time: 9.8s
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 r1097825 = re;
        double r1097826 = exp(r1097825);
        double r1097827 = im;
        double r1097828 = sin(r1097827);
        double r1097829 = r1097826 * r1097828;
        return r1097829;
}
↓
double f(double re, double im) {
        double r1097830 = im;
        double r1097831 = sin(r1097830);
        double r1097832 = re;
        double r1097833 = exp(r1097832);
        double r1097834 = r1097831 * r1097833;
        return r1097834;
}

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