Average Error: 5.7 → 0
Time: 4.1s
Precision: 64
\[e^{\log a + \log b}\]
↓
\[a \cdot b\]
e^{\log a + \log b}
↓
a \cdot b
double f(double a, double b) {
        double r5585244 = a;
        double r5585245 = log(r5585244);
        double r5585246 = b;
        double r5585247 = log(r5585246);
        double r5585248 = r5585245 + r5585247;
        double r5585249 = exp(r5585248);
        return r5585249;
}
↓
double f(double a, double b) {
        double r5585250 = a;
        double r5585251 = b;
        double r5585252 = r5585250 * r5585251;
        return r5585252;
}

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}{a \cdot b}\]

  3. Final simplification0

    \[\leadsto a \cdot b\]

Reproduce

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

  :herbie-target
  (* a b)

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