Average Error: 0.0 → 0.0
Time: 23.1s
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 r1729910 = re;
        double r1729911 = exp(r1729910);
        double r1729912 = im;
        double r1729913 = sin(r1729912);
        double r1729914 = r1729911 * r1729913;
        return r1729914;
}
↓
double f(double re, double im) {
        double r1729915 = im;
        double r1729916 = sin(r1729915);
        double r1729917 = re;
        double r1729918 = exp(r1729917);
        double r1729919 = r1729916 * r1729918;
        return r1729919;
}

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