Average Error: 0.0 → 0.0
Time: 22.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 r1379619 = re;
        double r1379620 = exp(r1379619);
        double r1379621 = im;
        double r1379622 = sin(r1379621);
        double r1379623 = r1379620 * r1379622;
        return r1379623;
}
↓
double f(double re, double im) {
        double r1379624 = im;
        double r1379625 = sin(r1379624);
        double r1379626 = re;
        double r1379627 = exp(r1379626);
        double r1379628 = r1379625 * r1379627;
        return r1379628;
}

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