Average Error: 5.7 → 0
Time: 3.9s
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 r5123385 = a;
        double r5123386 = log(r5123385);
        double r5123387 = b;
        double r5123388 = log(r5123387);
        double r5123389 = r5123386 + r5123388;
        double r5123390 = exp(r5123389);
        return r5123390;
}
↓
double f(double a, double b) {
        double r5123391 = a;
        double r5123392 = b;
        double r5123393 = r5123391 * r5123392;
        return r5123393;
}

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

  :herbie-target
  (* a b)

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