Average Error: 5.7 → 0
Time: 5.0s
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 r106459 = a;
        double r106460 = log(r106459);
        double r106461 = b;
        double r106462 = log(r106461);
        double r106463 = r106460 + r106462;
        double r106464 = exp(r106463);
        return r106464;
}
↓
double f(double a, double b) {
        double r106465 = b;
        double r106466 = a;
        double r106467 = r106465 * r106466;
        return r106467;
}

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 2019199 
(FPCore (a b)
  :name "Exp of sum of logs"

  :herbie-target
  (* a b)

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