Average Error: 5.7 → 0
Time: 3.8s
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 r2138930 = a;
        double r2138931 = log(r2138930);
        double r2138932 = b;
        double r2138933 = log(r2138932);
        double r2138934 = r2138931 + r2138933;
        double r2138935 = exp(r2138934);
        return r2138935;
}
↓
double f(double a, double b) {
        double r2138936 = b;
        double r2138937 = a;
        double r2138938 = r2138936 * r2138937;
        return r2138938;
}

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.7
Target0
Herbie0
\[a \cdot b\]

Derivation

  1. Initial program 5.7

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

  2. Simplified0

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

  3. Final simplification0

    \[\leadsto b \cdot a\]

Reproduce

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

  :herbie-target
  (* a b)

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