Average Error: 5.7 → 0
Time: 3.7s
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 r8332061 = a;
        double r8332062 = log(r8332061);
        double r8332063 = b;
        double r8332064 = log(r8332063);
        double r8332065 = r8332062 + r8332064;
        double r8332066 = exp(r8332065);
        return r8332066;
}
↓
double f(double a, double b) {
        double r8332067 = b;
        double r8332068 = a;
        double r8332069 = r8332067 * r8332068;
        return r8332069;
}

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

  :herbie-target
  (* a b)

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