Average Error: 5.7 → 0
Time: 4.7s
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 r6174985 = a;
        double r6174986 = log(r6174985);
        double r6174987 = b;
        double r6174988 = log(r6174987);
        double r6174989 = r6174986 + r6174988;
        double r6174990 = exp(r6174989);
        return r6174990;
}
↓
double f(double a, double b) {
        double r6174991 = a;
        double r6174992 = b;
        double r6174993 = r6174991 * r6174992;
        return r6174993;
}

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

  :herbie-target
  (* a b)

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