Average Error: 0.0 → 0.0

Time: 11.1s

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 r998666 = re;
        double r998667 = exp(r998666);
        double r998668 = im;
        double r998669 = sin(r998668);
        double r998670 = r998667 * r998669;
        return r998670;
}

↓

double f(double re, double im) {
        double r998671 = im;
        double r998672 = sin(r998671);
        double r998673 = re;
        double r998674 = exp(r998673);
        double r998675 = r998672 * r998674;
        return r998675;
}

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