Average Error: 5.6 → 0
Time: 3.9s
Precision: 64
\[e^{\log a + \log b}\]
↓
\[b \cdot a\]
e^{\log a + \log b}
↓
b \cdot a
double f(double a, double b) {
        double r2321961 = a;
        double r2321962 = log(r2321961);
        double r2321963 = b;
        double r2321964 = log(r2321963);
        double r2321965 = r2321962 + r2321964;
        double r2321966 = exp(r2321965);
        return r2321966;
}
↓
double f(double a, double b) {
        double r2321967 = b;
        double r2321968 = a;
        double r2321969 = r2321967 * r2321968;
        return r2321969;
}

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original5.6
Target0
Herbie0
\[a \cdot b\]

Derivation

  1. Initial program 5.6

    \[e^{\log a + \log b}\]

  2. Simplified0

    \[\leadsto \color{blue}{b \cdot a}\]

  3. Final simplification0

    \[\leadsto b \cdot a\]

Reproduce

herbie shell --seed 2019154 
(FPCore (a b)
  :name "Exp of sum of logs"

  :herbie-target
  (* a b)

  (exp (+ (log a) (log b))))