Average Error: 0.0 → 0.0
Time: 13.2s
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 r2351491 = re;
        double r2351492 = exp(r2351491);
        double r2351493 = im;
        double r2351494 = sin(r2351493);
        double r2351495 = r2351492 * r2351494;
        return r2351495;
}
↓
double f(double re, double im) {
        double r2351496 = im;
        double r2351497 = sin(r2351496);
        double r2351498 = re;
        double r2351499 = exp(r2351498);
        double r2351500 = r2351497 * r2351499;
        return r2351500;
}

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