Average Error: 0.0 → 0.0
Time: 13.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 r1664210 = re;
        double r1664211 = exp(r1664210);
        double r1664212 = im;
        double r1664213 = sin(r1664212);
        double r1664214 = r1664211 * r1664213;
        return r1664214;
}
↓
double f(double re, double im) {
        double r1664215 = im;
        double r1664216 = sin(r1664215);
        double r1664217 = re;
        double r1664218 = exp(r1664217);
        double r1664219 = r1664216 * r1664218;
        return r1664219;
}

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