Average Error: 0.0 → 0.0
Time: 8.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 r1502212 = re;
        double r1502213 = exp(r1502212);
        double r1502214 = im;
        double r1502215 = sin(r1502214);
        double r1502216 = r1502213 * r1502215;
        return r1502216;
}
↓
double f(double re, double im) {
        double r1502217 = im;
        double r1502218 = sin(r1502217);
        double r1502219 = re;
        double r1502220 = exp(r1502219);
        double r1502221 = r1502218 * r1502220;
        return r1502221;
}

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