Average Error: 0.0 → 0.0

Time: 8.3s

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 r842058 = re;
        double r842059 = exp(r842058);
        double r842060 = im;
        double r842061 = sin(r842060);
        double r842062 = r842059 * r842061;
        return r842062;
}

↓

double f(double re, double im) {
        double r842063 = im;
        double r842064 = sin(r842063);
        double r842065 = re;
        double r842066 = exp(r842065);
        double r842067 = r842064 * r842066;
        return r842067;
}

Error

The X axis uses an exponential scale — Bits error versus `re`

Try it out

In
Out

Enter valid numbers for all inputs

Derivation

Initial program 0.0
\[e^{re} \cdot \sin im\]
Final simplification0.0
\[\leadsto \sin im \cdot e^{re}\]

Reproduce

herbie shell --seed 2019121 +o rules:numerics
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  (* (exp re) (sin im)))